We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byJaylene Standridge
Modified about 1 year ago
1 ©D.Moshkovitz Complexity The Traveling Salesman Problem
2 ©D.Moshkovitz Complexity The Mission: A Tour Around the World
3 ©D.Moshkovitz Complexity The Problem: Traveling Costs Money 1795$
4 ©D.Moshkovitz Complexity Introduction Objectives: –To explore the Traveling Salesman Problem. Overview: –TSP: Formal definition & Examples –TSP is NP-hard –Approximation algorithm for special cases –Inapproximability result
5 ©D.Moshkovitz Complexity TSP Instance: a complete weighted undirected graph G=(V,E) (all weights are non-negative). Problem: to find a Hamiltonian cycle of minimal cost. 3 43 2 5 1 10
6 ©D.Moshkovitz Complexity Polynomial Algorithm for TSP? What about the greedy strategy: At any point, choose the closest vertex not explored yet?
7 ©D.Moshkovitz Complexity The Greedy $trategy Fails 5 0 3 1 12 10 2
8 ©D.Moshkovitz Complexity The Greedy $trategy Fails 5 0 3 1 12 10 2
9 ©D.Moshkovitz Complexity TSP is NP-hard The corresponding decision problem: Instance: a complete weighted undirected graph G=(V,E) and a number k. Problem: to find a Hamiltonian path whose cost is at most k.
10 ©D.Moshkovitz Complexity TSP is NP-hard Theorem: HAM-CYCLE p TSP. Proof: By the straightforward efficient reduction illustrated below: HAM-CYCLETSP 1 2 1 1 1 2k=|V| verify!
11 ©D.Moshkovitz Complexity What Next? We’ll show an approximation algorithm for TSP, with approximation factor 2 for cost functions that satisfy a certain property.
12 ©D.Moshkovitz Complexity The Triangle Inequality Definition: We’ll say the cost function c satisfies the triangle inequality, if u,v,w V : c(u,v)+c(v,w) c(u,w)
13 ©D.Moshkovitz Complexity Approximation Algorithm 1. Grow a Minimum Spanning Tree (MST) for G. 2. Return the cycle resulting from a preorder walk on that tree. COR(B) 525-527
14 ©D.Moshkovitz Complexity Demonstration and Analysis The cost of a minimal Hamiltonian cycle the cost of a MST
15 ©D.Moshkovitz Complexity Demonstration and Analysis The cost of a preorder walk is twice the cost of the tree
16 ©D.Moshkovitz Complexity Demonstration and Analysis Due to the triangle inequality, the Hamiltonian cycle is not worse.
17 ©D.Moshkovitz Complexity The Bottom Line optimal HAM cycle MST preorder walk our HAM cycle = ½· ½·
18 ©D.Moshkovitz Complexity What About the General Case? We’ll show TSP cannot be approximated within any constant factor 1 By showing the corresponding gap version is NP-hard. COR(B) 528
19 ©D.Moshkovitz Complexity gap-TSP[ ] Instance: a complete weighted undirected graph G=(V,E). Problem: to distinguish between the following two cases: There exists a Hamiltonian cycle, whose cost is at most |V|. The cost of every Hamiltonian cycle is more than |V|.
20 ©D.Moshkovitz Complexity Instances min cost |V| |V| 1 1 1 0 +1 0 0 1
21 ©D.Moshkovitz Complexity What Should an Algorithm for gap-TSP Return? |V| |V| YES!NO! min cost gap DON’T-CARE...
22 ©D.Moshkovitz Complexity gap-TSP & Approximation Observation: Efficient approximation of factor for TSP implies an efficient algorithm for gap-TSP[ ].
23 ©D.Moshkovitz Complexity gap-TSP is NP-hard Theorem: For any constant 1, HAM-CYCLE p gap-TSP[ ]. Proof Idea: Edges from G cost 1. Other edges cost much more.
24 ©D.Moshkovitz Complexity The Reduction Illustrated HAM-CYCLEgap-TSP 1 |V|+1 1 1 1 Verify (a) correctness (b) efficiency
25 ©D.Moshkovitz Complexity Approximating TSP is NP- hard gap-TSP[ ] is NP-hard Approximating TSP within factor is NP-hard
26 ©D.Moshkovitz Complexity Summary We’ve studied the Traveling Salesman Problem (TSP). We’ve seen it is NP-hard. Nevertheless, when the cost function satisfies the triangle inequality, there exists an approximation algorithm with ratio-bound 2.
27 ©D.Moshkovitz Complexity Summary For the general case we’ve proven there is probably no efficient approximation algorithm for TSP. Moreover, we’ve demonstrated a generic method for showing approximation problems are NP-hard.
1 The TSP : Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell ( )
1 The TSP : NP-Completeness Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell.
1 Approximation Algorithms. 2 Motivation By now we’ve seen many NP-Complete problems. We conjecture none of them has polynomial time algorithm.
Design and Analysis of Algorithms Approximation algorithms for NP-complete problems Haidong Xue Summer 2012, at GSU.
1 Combinatorial Algorithms Metric problems. Minimum Spanning Tree Given an undirected graph G=(V,E) with nonnegative edge costs c: E(G) → R. Find a spanning.
Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.
Lecture 231 Programming & Data Structures NP-Complete Problems GRIFFITH COLLEGE DUBLIN.
Complexity ©D Moshkovitz 1 Approximation Algorithms Is Close Enough Good Enough?
1 Optimization problems such as MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP, KNAPSACK, BINPACKING do not have a polynomial.
CS6045: Advanced Algorithms NP Completeness. NP-Completeness Some problems are intractable: as they grow large, we are unable to solve them in reasonable.
Lecture 25 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Lecture 6 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
Complexity ©D.Moshkovitz 1 Paths On the Reasonability of Finding Paths in Graphs.
Introduction to Approximation Algorithms Lecture 12: Mar 1.
Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Approximation Algorithms These lecture slides are adapted from CLRS.
Approximation Algorithms for TSP Tsvi Kopelowitz 1.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 8: Complexity Theory.
The Traveling Salesman Problem Approximation Rachit Shah March 3 Class Notes CSE Department UTA Arlington CSE 6311 Adv Comp Models and Algorithms Prof:
Advanced Algorithm Design and Analysis (Lecture 13) SW5 fall 2004 Simonas Šaltenis E1-215b
COSC 3101A - Design and Analysis of Algorithms 14 NP-Completeness.
Approximation Algorithms Lecture for CS 302. What is a NP problem? Given an instance of the problem, V, and a ‘certificate’, C, we can verify V is in.
1 NP-Complete Problems. 2 We discuss some hard problems: how hard? (computational complexity) what makes them hard? any solutions? Definitions
TU/e Algorithms (2IL15) – Lecture 11 1 Approximation Algorithms.
An introduction to Approximation Algorithms Presented By Iman Sadeghi.
Approximation Algorithms for TSP Tsvi Kopelowitz Ariel Rosenfeld 1.
1 Ch 10 - NP-completeness Tractable and intractable problems Decision/Optimization problems Deterministic/NonDeterministic algorithms Classes P and NP.
End Topics Approximate Vertex Cover Approximate TSP Tour Computation of FFT P, NP, NP Complete, NP hard.
P, NP, and NP-Complete Suzan Köknar-Tezel 1. CSC 551 Design and Analysis of Algorithms Giving credit where credit is due These lecture notes are based.
Approximation Algorithms Chapter 1- Introduction.
Approximation Algorithms Approximation Algorithms2 Outlines Why approximation algorithm? Approximation ratio Approximation vertex cover.
Theory of Computing Lecture 10 MAS 714 Hartmut Klauck.
Algorithms for Network Optimization Problems This handout: Minimum Spanning Tree Problem Approximation Algorithms Traveling Salesman Problem.
The Theory of NP-Completeness Tractable and intractable problems NP-complete problems.
Complexity 1 Hardness of Approximation. Complexity 2 Introduction Objectives: –To show several approximation problems are NP-hard Overview: –Reminder:
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb Jerry Le
CSE 024: Design & Analysis of Algorithms Chapter 9: NP Completeness Sedgewick Chp:40 David Luebke’s Course Notes / University of Virginia, Computer Science.
CSC 413/513: Intro to Algorithms NP Completeness Continued: Reductions.
Minimum Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan
Great Theoretical Ideas in Computer Science for Some.
David Luebke 1 2/18/2016 CS 332: Algorithms NP Completeness Continued: Reductions.
Complexity Classes (Ch. 34) The class P: class of problems that can be solved in time that is polynomial in the size of the input, n. if input size is.
34.NP Completeness. Computer Theory Lab. Chapter 34P.2.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2006 Lecture 7 Monday, 4/3/06 Approximation Algorithms.
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
MCS 312: NP Completeness and Approximation algorthms Instructor Neelima Gupta
The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness and course wrap up.
© 2017 SlidePlayer.com Inc. All rights reserved.