note12 - Outline 1 How to Deal with NPC Problems 2...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Outline 1 How to Deal with NPC Problems 2 Approximation Algorithms 3 Heuristic Algorithms 4 Approximation Algorithms: Minimum Vertex Cover (MVC) 5 Traveling Salesman Problem (TSP) 6 TSP: Approximation Algorithm 7 TSP: Christofides Algorithm 8 Polynomial Time Approximation Scheme c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 1 / 44 Approximation Algorithms We have a NPC problem Q . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 44 Approximation Algorithms We have a NPC problem Q . Then it is extremely unlikely Q can be solved in polynomial time. What to do? Just give up? c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 44 Approximation Algorithms We have a NPC problem Q . Then it is extremely unlikely Q can be solved in polynomial time. What to do? Just give up? Many NPC problems are natural problems with important applications. We cannot afford to just give up! c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 44 Approximation Algorithms We have a NPC problem Q . Then it is extremely unlikely Q can be solved in polynomial time. What to do? Just give up? Many NPC problems are natural problems with important applications. We cannot afford to just give up! Many NPC problems are hard to solve if we insist on absolute optimal solution . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 44 Approximation Algorithms We have a NPC problem Q . Then it is extremely unlikely Q can be solved in polynomial time. What to do? Just give up? Many NPC problems are natural problems with important applications. We cannot afford to just give up! Many NPC problems are hard to solve if we insist on absolute optimal solution . But if we settle for nearly optimal solutions (for example, within 50 % of optimal), it might be possible to solve Q . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 44 Approximation Algorithms We have a NPC problem Q . Then it is extremely unlikely Q can be solved in polynomial time. What to do? Just give up? Many NPC problems are natural problems with important applications. We cannot afford to just give up! Many NPC problems are hard to solve if we insist on absolute optimal solution . But if we settle for nearly optimal solutions (for example, within 50 % of optimal), it might be possible to solve Q . In many applications, a nearly optimal solution might be good enough. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 44 Approximation Algorithms We have a NPC problem Q . Then it is extremely unlikely Q can be solved in polynomial time. What to do? Just give up?...
View Full Document

This note was uploaded on 02/27/2012 for the course CSE 431/531 taught by Professor Xinhe during the Fall '11 term at SUNY Buffalo.

Page1 / 156

note12 - Outline 1 How to Deal with NPC Problems 2...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online