presented by:instructor: rahmtin rotabi prof. zarrabi- z adeh
DESCRIPTION
An O ( log n ) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem Chandra Chekuri Martin P´al. Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh. Introduction. ATSPP: Asymmetric Traveling Salesman Path Problem Given Info - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/1.jpg)
![Page 2: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/2.jpg)
An O(logn) Approximation Ratio for theAsymmetric Traveling Salesman PathProblem
Chandra Chekuri Martin P´al
Presented by:Instructor:
Rahmtin RotabiProf. Zarrabi-Zadeh
2
![Page 3: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/3.jpg)
3
Introduction
• ATSPP: Asymmetric Traveling Salesman Path Problem• Given Info• •
• Objective• Find optimum - path in • NP Hard
![Page 4: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/4.jpg)
4
Past works
• Metric-TSP• Christofides
• ATSP• factor• Best known factor:
• Metric-TSPP• best known factor
![Page 5: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/5.jpg)
5
Past works (cont’d)• ATSPP- our problem• approximation• Proved by Lam and Newman
![Page 6: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/6.jpg)
6
ATSP (Tour)
• -factor for ATSPP -factor for ATSP • Two algorithms for ATSP• Reducing vertices by cycle cover
• Factor • Proof is straight forward
• Min-Density Cycle Algorithm • Factor • Proof is just like “set cover”
![Page 7: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/7.jpg)
7
ATSPP- Our work
• denotes the set of all paths• denotes cycle not containing s and t• Density?
![Page 8: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/8.jpg)
8
Density lemma
• Assumption:• let be the min-density path of non-trivial path in
• Objective:• We can either find the min-density path• Or a cycle in with a lower density
• Idea of proof:• Binary search• Bellman-ford
![Page 9: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/9.jpg)
9
Augmentation lemma• Definitions:• Domination• Extension• Successor
• Assumptions:• Let in such that dominates
• Objective:• There is a path that dominates , extends
![Page 10: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/10.jpg)
10
Augmentation lemma proof• Define • Mark some members of with an algorithm• Name them • Obtain P3 from P1• Replace of by the sub-path
![Page 11: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/11.jpg)
11
Augmentation lemma proof(cont’d)
• The path extends • The path dominates • Straight-forward with following in-equalities• (I1) For we have • (I2) For we have • (I3) For we have
• Corollary: Replace with
![Page 12: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/12.jpg)
12
Algorithm
• Start with only one edge• Use proxies • Until we have a spanning path• Use path or cycle augmentation
• It will finish after at most iterations• Implemented naively:
![Page 13: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/13.jpg)
13
Claims and proof• In every iteration, if is the augmenting path or cycle in that
iteration,
• Use augmentation path lemma• Algorithm factor is .• Step is from k1 to k2 vertices
• Path step
• Cycle step
![Page 14: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/14.jpg)
14
Path-constrained ATSPP
• Start from • Instead of • Same analysis
• Best integrality gap for ATSPP is 2• Best integrality gap for ATSP is • LP:
![Page 15: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/15.jpg)
15
Any Question?
![Page 16: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/16.jpg)
16
References
• An O(logn) Approximation Ratio for theAsymmetric Traveling Salesman Path Problem, THEORY OF COMPUTING, Volume 3 (2007), pp. 197–209.
• Traveling salesman path problem, Mathematical Journal, Volume 113, Issue 1, pp 39-59
![Page 17: Presented by:Instructor: Rahmtin Rotabi Prof. Zarrabi- Z adeh](https://reader036.vdocument.in/reader036/viewer/2022070504/56816764550346895ddc40df/html5/thumbnails/17.jpg)
17
Thank you for your time