improved approximations for graph-tsp in regular graphsravi/gtsp-talk.pdfresults 1. size 4n/3 in a...
TRANSCRIPT
![Page 1: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/1.jpg)
Improved Approximations for Graph-TSP in Regular Graphs
R RaviCarnegie Mellon University
Joint work with Uriel Feige (Weizmann), Satoru Iwata (U Tokyo), Jeremy Karp (CMU), Alantha
Newman (G-SCOP) and Mohit Singh (MSR)
1
![Page 2: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/2.jpg)
Graph TSP
Given a connected unweighted graph, a tour is a closed walk that visits every vertex at least once.
Objective: find shortest tour.
Ideally – a Hamiltonian cycle.
2
![Page 3: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/3.jpg)
3
![Page 4: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/4.jpg)
A tour may use the same edge twice
4
![Page 5: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/5.jpg)
A tour may use the same edge twicelength 8x1 + 1x2 = 10
5
![Page 6: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/6.jpg)
Results
1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes
(WG14, joint with Satoru Iwata and Alantha Newman)
“Regular graphs have short tours”2. Size 9n/7 in cubic bipartite graphs (APPROX14, joint with Jeremy Karp)
3. Size (1 + 𝑂(1
𝑑))n in d-regular graphs
(IPCO14, joint with Uri Feige and Mohit Singh)
6
![Page 7: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/7.jpg)
Main ideas for short tours
1. Augment spanning tree with carefully chosen edges
2. Delete carefully chosen edges from the whole graph
3. Augment cycle cover with few cycles
4. Augment path cover with few paths
7
![Page 8: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/8.jpg)
General bounds
In every connected n-vertex graph, the length of the shortest tour is between nand 2n-2.
8
![Page 9: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/9.jpg)
9
![Page 10: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/10.jpg)
Spanning tree lower bound
10
![Page 11: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/11.jpg)
Double spanning tree edges, drop remaining edges
11
![Page 12: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/12.jpg)
Christofides 1976
• A 3/2-approximation to graph TSP (and more generally, metric TSP).
Tour composed of union of:
• (minimum) Spanning tree.
• Minimum T-join on odd-degree vertices.
Gives a connected Eulerian graph (= tour).
12
![Page 13: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/13.jpg)
Recall definitions
Let T be a subset of the vertex set of a graph. An edge set is called a T-join if in the induced subgraph of this edge set, the collection of all the odd-degree vertices is T.
A graph is Eulerian if all degrees are even. A connected Eulerian (multi)-graph has an Eulerian circuit: a walk that uses every edge exactly once.
13
![Page 14: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/14.jpg)
Christofides for graph TSP
14
![Page 15: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/15.jpg)
Arbitrary spanning tree
15
![Page 16: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/16.jpg)
Odd degree vertices
16
![Page 17: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/17.jpg)
Odd degree vertices
17
![Page 18: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/18.jpg)
Find minimum T-join
18
![Page 19: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/19.jpg)
Union of the T-join…
19
![Page 20: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/20.jpg)
… and the spanning tree
20
![Page 21: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/21.jpg)
Union of T-join and the spanning tree
21
![Page 22: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/22.jpg)
Drop remaining edges
22
![Page 23: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/23.jpg)
Analysis
The algorithm gives a connected multi-graph with even degrees. It has an Eulerian tour.
Spanning trees and minimum T-joins can be found in polynomial time.
Approximation ratio:
Spanning tree < opt
Minimum T-join ≤ opt/2
Christofides tour < 3opt/2
23
![Page 24: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/24.jpg)
Upper bound on T-join
24
![Page 25: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/25.jpg)
Consider optimal tour
25
![Page 26: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/26.jpg)
Ignore other edges
26
![Page 27: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/27.jpg)
Take either even or odd segments
27
![Page 28: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/28.jpg)
The even segments
28
![Page 29: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/29.jpg)
The odd segments
29
![Page 30: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/30.jpg)
Steiner Cycles
Obs: If G has a spanning tree T and a simple cycle C on the odd nodes of T, then it has a tour of length 4n/3
• |C| > 2n/3 Contract cycle and double remaining spanning tree
• |C| < 2n/3 Use Christofides’ idea and take shorter of even and odd segments to get T-join of size at most n/3
Cor: If G has a Hamiltonian path, then it has a tour of length 4n/3
30
![Page 31: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/31.jpg)
Approximating TSP
• NP-hard and APX-hard.
• 3/2 still best approx ratio for metric TSP.
• Dantzig, Fulkerson, Johnson (aka Held-Karp)linear program gives at least as good approximation. Moreover, worst integrality gap example known is 4/3, on an instance of graph TSP of max degree 3.
• For graph TSP, there has been substantial progress in recent years, leading to 7/5approximation [Sebo and Vygen 2012]
31
![Page 32: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/32.jpg)
Oveis-Gharan, Saberi and Singh 2011
Thm: Graph TSP can be approximated within a ratio better than 3/2.
Proof idea: Rather than starting from arbitrary spanning tree, start with one that would give a cheaper T-join than OPT/2. Use fractional solution of LP to define a distribution over spanning trees, sample one at random, and it is likely to have a cheap T-join.
32
![Page 33: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/33.jpg)
Main ideas for short tours
1. Augment spanning tree with carefully chosen edges
2. Delete carefully chosen edges from the whole graph
3. Augment cycle cover with few cycles
4. Augment path cover with few paths
33
![Page 34: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/34.jpg)
Mömke and Svensson 2011
• A different approach, giving a 1.461 approximation for graph-TSP.
• Every 3-regular 2-vertex connected graph has a tour of length at most 4n/3. (Also proven independently and differently by Aggarwal, Garg, Gupta ‘11 and Boyd, Sitters, van der Ster, Stougie ‘11)
• Improvement of analysis to 13/9 (Mucha ‘12)
34
![Page 35: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/35.jpg)
Mömke and Svensson 2011
Every 3-regular 2-vertex connected graph has a tour of length at most 4n/3.
New ideas:
• Use probability distribution over T-joins to fix up a single tree
• Delete carefully chosen edges from T-join
35
![Page 36: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/36.jpg)
Naddef and Pulleyblank 1981
Assigning every edge in a 3-regular 2-vertex connected graph a value of 1/3 puts it in the perfect matching polytope
Theorem [Edmonds 1964]: Perfect Matching polytope characterization
36
![Page 37: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/37.jpg)
Naddef and Pulleyblank 1981
Assigning every edge in a 3-regular 2-vertex connected graph a value of 1/3 puts it in the perfect matching polytope
• |S| odd and cubic graph implies |δ(S)| odd
• 2-connectivity implies |δ(S)| ≥ 337
![Page 38: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/38.jpg)
Naddef and Pulleyblank 1981
Assigning every edge in a 3-regular 2-vertex connected graph G a value of 1/3 puts it in the perfect matching polytope
(Caratheodory’s theorem): G with 1/3 on every edge can be written as a convex combination of a polynomial number of perfect matchings M1, M2, …, Mk
38
![Page 39: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/39.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B– P: Tree edges with back edge hanging from parent– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G– For all edges in M ∩ B, delete it from H– For all edges in M ∩ P, delete it from H– For all edges in M ∩ Q, double it in H
Claim: H is an Eulerian connected graph (and hence contains a tour)
39
![Page 40: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/40.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G
– For all edges in M ∩ B, delete it from H
– For all edges in M ∩ P, delete it from H
– For all edges in M ∩ Q, double it in H
40
![Page 41: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/41.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
41
![Page 42: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/42.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
42
![Page 43: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/43.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G
– For all edges in M ∩ B, delete it from H
– For all edges in M ∩ P, delete it from H
– For all edges in M ∩ Q, double it in H
43
![Page 44: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/44.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G
– For all edges in M ∩ B, delete it from H
– For all edges in M ∩ P, delete it from H
– For all edges in M ∩ Q, double it in H
44
![Page 45: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/45.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G
– For all edges in M ∩ B, delete it from H
– For all edges in M ∩ P, delete it from H
– For all edges in M ∩ Q, double it in H
45
Claim: H is a connected Euleriangraph
![Page 46: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/46.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G
– For all edges in M ∩ B, delete it from H
– For all edges in M ∩ P, delete it from H
– For all edges in M ∩ Q, double it in H
46
![Page 47: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/47.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G
– For all edges in M ∩ B, delete it from H
– For all edges in M ∩ P, delete it from H
– For all edges in M ∩ Q, double it in H
47
![Page 48: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/48.jpg)
Mömke and Svensson 2011
• Pick a DFS tree T with a set of back edges B
– P: Tree edges with back edge hanging from parent
– Q = T\P
• Pick a matching M randomly from the distribution defined by x=1/3 on E(G)
• Initialize solution H to whole graph G
– For all edges in M ∩ B, delete it from H
– For all edges in M ∩ P, delete it from H
– For all edges in M ∩ Q, double it in H
48
Claim: H is a connected Euleriangraph
![Page 49: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/49.jpg)
Mömke and Svensson 2011
Claim: H is an Eulerian connected graph (and hence contains a tour)
• Eulerian: Every node has initial degree 3. One matching edge incident is deleted or doubled making degree 2 or 4
• Connected (Bottom up induction)– If tree edge in P deleted, back edge hanging from
parent connects subtree to upper part
– If back edge in B is deleted, its sibling tree edge in P connects both sides
49
![Page 50: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/50.jpg)
Mömke and Svensson 2011
E[|H|] = |G| - E[|M ∩ B|] - E[|M ∩ P|] + E[|M ∩ Q|]
= 3n/2 - (1/3) |B| - (1/3) |P| + (1/3) |Q|
≈ 3n/2 - (1/3)(n/2) – (1/3) (n/2) + (1/3) (n/2)
= 9n/6 - n/6
= 4n/3
Theorem: Every 3-regular 2-vertex connected graph has a tour of length at most 4n/3
50
![Page 51: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/51.jpg)
Main ideas for short tours
1. Augment spanning tree with carefully chosen edges
2. Delete carefully chosen edges from the whole graph
3. Augment cycle cover with few cycles
4. Augment path cover with few paths
51
![Page 52: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/52.jpg)
Sebo and Vygen 2012
• Find a ‘nice’ ear decomposition of G based on Frank’s min-max theorem for min number of even ears
• Pick a set of edges based on the decomposition (ear-muff) to form a connected sugraph
• Extend chosen subgraph to an even supergraph by inductively adding edges from the pendant ears– If many pendant ears, add T-join on odd nodes (augment)
– If few pendant ears, use Mömke and Svensson’s method (deletion)
Theorem: 7/5-approximation for graph-TSP (best known currently)
52
![Page 53: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/53.jpg)
Main ideas for short tours
1. Augment spanning tree with carefully chosen edges
2. Delete carefully chosen edges from the whole graph
3. Augment cycle cover with few cycles
4. Augment path cover with few paths
53
![Page 54: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/54.jpg)
Augment cycle cover with few cycles
• Find a cycle cover with few cycles.
• Connect it by doubled edges to get a connected Eulerian multi-graph.
• If the cycle cover has c cycles, the tour length is at most n + 2(c-1).
• Need c to be small, i.e., average cycle length to be large.
54
![Page 55: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/55.jpg)
Cycle cover
55
![Page 56: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/56.jpg)
Connecting the cycle cover
56
![Page 57: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/57.jpg)
Drop remaining edges
57
![Page 58: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/58.jpg)
Simple 3n/2 tour in cubic bipartite graphs
1. Find a cycle cover with no parallel edges (e.g. union of any two disjoint perfect matchings)
Bipartite implies no odd cycles min cycle length is 4 At most n/4 cycles
2. Add doubled spanning tree connecting cycles
Total no of edges ≈ n + 2(n/4)
58
![Page 59: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/59.jpg)
Simple 4n/3 tour in cubic bipartite graphs
1. While there is a square, replace it with a gadget
2. Find cycle cover in square-free graph
3. Expand gadgets maintaining square-free cycle cover
Total no of edges ≈ n + 2(n/6)
59
![Page 60: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/60.jpg)
Replacing Squares
60
![Page 61: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/61.jpg)
Replacing Squares 1
61
![Page 62: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/62.jpg)
Replacing Squares 1
62
![Page 63: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/63.jpg)
Replacing Squares 2
63
![Page 64: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/64.jpg)
Replacing Squares 2
64
![Page 65: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/65.jpg)
Replacing Squares 3
65
![Page 66: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/66.jpg)
Replacing Squares 3
66
![Page 67: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/67.jpg)
Better than 4/3 approximation?
Sub-cubic graph instances already require 4n/3edges.
67
![Page 68: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/68.jpg)
Better than 4/3 approximation?Correa, Larre, Soto 2011, 20122-edge-connected cubic graphs have a tour of length (4/3 – 1/61236)n 3-edge-connected bipartite cubic graphs have a tour of length (4/3 – 1/108)nJeremy Karp, Ravi 2013Cubic bipartite graphs have a tour of length 9n/7Van Zuylen 2015 Cubic bipartite graphs have a tour of length 5n/4Open: Barnette’s Conjecture : 3-connected planar bipartite cubic graphs have a Hamiltonian cycleNewman 2014Momke-Svensson gives tour of length 46n/33 in subquarticgraphs
68
![Page 69: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/69.jpg)
Main idea: Replace short cycles
69
![Page 70: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/70.jpg)
Algorithm Sketch
“Organic”: made up of original nodes and edges (not resulting from earlier replacements)
1. While graph contains 4-cycle or organic 6-cycle, COMPRESS by replacing cycle with gadget
2. Find cycle cover in final compressed graph
3. EXPAND compressed cycles in reverse order rewiring cycle cover to span all deleted nodes
70
![Page 71: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/71.jpg)
Algorithm Example
71
![Page 72: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/72.jpg)
Algorithm Example
72
![Page 73: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/73.jpg)
Algorithm: Good Expansion
73
![Page 74: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/74.jpg)
Algorithm: Bad Expansion
74
![Page 75: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/75.jpg)
Handling Bad Expansions
75
![Page 76: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/76.jpg)
After handling, y ≥ 3
76
![Page 77: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/77.jpg)
Analysis: Protected Edges
77
![Page 78: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/78.jpg)
Analysis Outline
78
• Every 6-cycle can be disjointly charged towards 2 or 3 protected edges
• If a final cycle has P protected edges, at most P/3 6-cycles are charged to it
• Final amortized average cycle length ≥ 7
• Total number of edges ≤ n + 2 (n/7)
![Page 79: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/79.jpg)
Main ideas for short tours
1. Augment spanning tree with carefully chosen edges
2. Delete carefully chosen edges from the whole graph
3. Augment cycle cover with few cycles
4. Augment path cover with few paths
79
![Page 80: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/80.jpg)
Nisheeth Vishnoi 2012
• Thm: Every n-vertex d-regular graph has a tour of length (1 + o(1))n, where the o(1) term tends to 0 as d grows.
• Moreover, such a tour can be found in random polynomial time.
80
![Page 81: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/81.jpg)
Vishnoi’s approach
• Find a cycle cover with few cycles.
• Connect it by doubled edges to get a connected Eulerian multi-graph.
• If the cycle cover has c cycles, the tour length is at most n + 2(c-1).
• Need c to be small.
81
![Page 82: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/82.jpg)
Key questions
• Why would a d-regular graph have a cycle cover with few cycles?
• Even if such a cycle cover exists, how can it be found?(A Hamiltonian cycle is a cycle cover with one cycle, but it is NP-hard to find it.)
82
![Page 83: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/83.jpg)
Matrix representation of cycle covers
Given G, consider its n by n adjacency matrix A.
An all-1 permutation is a cycle cover.
111
111
111
111
111
111
111
11183
![Page 84: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/84.jpg)
Permanents and cycle covers
• The permanent of the adjacency matrix is precisely the number of cycle covers.
• For d-regular graphs, the matrix is doubly stochastic (after scaling by 1/d).
• Van-der-Warden’s conjecture [1926] (proved by Egorychev and by Falikman [1981]) implies that the permanent is large.
84
![Page 85: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/85.jpg)
Permanents and cycle covers[Vishnoi 2012; ~Noga Alon 2003]
• Van-der-Warden’s conjecture implies that d-regular graphs have many different cycle covers.
• There are only few permutations with linearly many cycles (a random permutation has O(log n) cycles).
• A random cycle cover in a d-regular graph has
𝑂(𝑛
log 𝑑) cycles.
85
![Page 86: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/86.jpg)
Vishnoi’s algorithm
Use the approximation algorithm of JerrumSinclair and Vigoda [2004] for the permanent to find a random cycle cover.
Connect it using double edges to get a connected Eulerian subgraph.
In a d-regular graph, this gives a tour of length
1 + 𝑂1
log 𝑑𝑛
86
![Page 87: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/87.jpg)
Regularity is essential
Graphs of minimum degree d need not have short tours.
d
n-d87
![Page 88: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/88.jpg)
Improved bounds
Thm: Every n-vertex d-regular graph has a tour of length (1 + o(1))n, where the o(1) term tends to 0 as d grows.
Moreover, such a tour can be found in random polynomial time.
Vishnoi 2012 𝑜 1 = 𝑂(1
log 𝑑)
Feige, Ravi, Singh 2014 𝑜 1 = 𝑂(1
𝑑)
88
![Page 89: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/89.jpg)
Our proof approach
• Find a spanning tree with a small set T of odd degree vertices.
• Find a small T-join, of size O(|T|) + O(n/d).
The union of the spanning tree and T-join is a connected Eulerian subgraph, hence a tour of length n + O(|T|) + O(n/d).
How small can we make |T|?
In our proof T = 𝑂𝑛
𝑑.
89
![Page 90: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/90.jpg)
Proof approach
• Find a spanning tree with a small set T of odd degree vertices.
• Find a small T-join, of size O(|T|) + O(n/d).
The union of the spanning tree and T-join is a connected Eulerian subgraph, hence a tour of length n + O(|T|) + O(n/d).
90
![Page 91: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/91.jpg)
Why is there a T-join of size O(|T|) + O(n/d)?
Let T’ be a tree spanning T.
Claim: There is a T-join supported only on edges of T’, and hence of size at most |T’|-1.
91
![Page 92: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/92.jpg)
Upper bound on T-join
92
![Page 93: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/93.jpg)
A tree T’ spanning T
93
![Page 94: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/94.jpg)
A tree T’ spanning T
94
![Page 95: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/95.jpg)
A T-join
95
![Page 96: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/96.jpg)
Tree T’ of size at most 2|T| + 3n/(d+1) spanning a set T
• A 3-net: maximal set of vertices, no two of which at distance less than 3 from each other.
• 3-net has at most n/(d+1) vertices.
• Every vertex from T at distance at most 2 from 3-net.
• All of T plus the 3-net can be connected by 2|T| + 3n/(d+1)-3 edges.
96
![Page 97: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/97.jpg)
Proof approach
• Find a spanning tree with a small set T of odd degree vertices.
• Find a small T-join, of size O(|T|) + O(n/d).
The union of the spanning tree and T-join is a connected Eulerian subgraph, hence a tour of length n + O(|T|) + O(n/d).
97
![Page 98: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/98.jpg)
Proof approach
• Find a spanning tree with a small set T of odd degree vertices.
• Find a small T-join, of size O(|T|) + O(n/d).
The union of the spanning tree and T-join is a connected Eulerian subgraph, hence a tour of length n + O(|T|) + O(n/d).
98
![Page 99: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/99.jpg)
Spanning tree with few odd degree vertices
Thm: Every connected d-regular graph has a
spanning tree with 𝑂(𝑛
𝑑) odd degree vertices.
Proof approach: cover all vertices in G by a small number of paths (a spanning linear forest).Complete to a spanning tree arbitrarily.
If the number of paths is P, then the number of odd degree vertices in the resulting spanning tree is at most 2P-2.
99
![Page 100: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/100.jpg)
100
![Page 101: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/101.jpg)
A spanning linear forest
101
![Page 102: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/102.jpg)
A spanning linear forest
102
![Page 103: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/103.jpg)
Main ideas for short tours
1. Augment spanning tree with carefully chosen edges
2. Delete carefully chosen edges from the whole graph
3. Augment cycle cover with few cycles
4. Augment path cover with few paths
103
![Page 104: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/104.jpg)
Path cover number
The fewest number of components in a linear forest is the path cover number of the graph.
Conjecture [Magnant and Martin, 2009]: the path cover number of a d-regular graph is at most n/(d+1).
Proved for d < 6.
If true for all d, would imply a tour of length (1 + O(1/d))n. Better than what we know how to prove.
104
![Page 105: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/105.jpg)
Linear arboricity conjecture
Arboricity – covering all edges by forests.
Linear arboricity – covering all edges by linear forests.
Conjecture [Akiyama, Exoo, Harary, 1981]: in d-
regular graphs, 𝑑+1
2linear forests suffice.
If true, one of these linear forests has at least n – O(n/d) edges, and hence at most O(n/d) components.
105
![Page 106: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/106.jpg)
Results on linear arboricity conjecture
Alon, Teague and Wormald 2001 (see also Alon and
Spencer): Linear arboricity is at most 𝑑+ 𝑂(𝑑
23)
2.
Implies linear forest of size 1 − 𝑂1
𝑑
1
3𝑛, and
by our results, a tour of length 1 + 𝑂1
𝑑
1
3𝑛.
106
![Page 107: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/107.jpg)
Improved bounds
Thm: every d-regular graph has a path cover
with 𝑂(𝑛
𝑑) paths.
Corollary: every d-regular graph has a tour of
length 1 + 𝑂(1
𝑑) 𝑛.
107
![Page 108: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/108.jpg)
Inductive construction of a path cover
Single vertex v: any two of its edges can be used as part of a path.
Path between s and t: only one edge from each endpoint can be used as part of a longer path.
Cannot contract the path to a single vertex.
108
![Page 109: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/109.jpg)
Inductive construction of a path coverEasier for directed graphs
Path between s and t: only one edge from each endpoint can be used as part of a longer path.
Cannot contract the path to a single vertex.
If edges are oriented, directed path from s to t can be contracted to single vertex, leaving incoming edges to s and outgoing edges from t.
109
![Page 110: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/110.jpg)
Orienting the edges
• Suppose for simplicity that d is even.
• Take an Euler tour through all edges.
• Orient the edges according to tour.
• Gives a directed graph with in and out degrees d/2.
110
![Page 111: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/111.jpg)
Algorithm Sketch: One phase
• Pair up nodes arbitrarily• Put the two nodes of a pair in (L,R) or (R,L)
respectively at random• Find max matching of directed edges from L to R;
Use “dummy” edges to complete to a perfect matching M
• Delete non matching arcs from L to R and all arcs within L and within R
• Use matching arc to “extend” paths and reduce number of paths by half
111
![Page 112: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/112.jpg)
Algorithm Sketch: One phase
112
![Page 113: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/113.jpg)
Algorithm Sketch: One phase
113
![Page 114: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/114.jpg)
Algorithm Sketch: One phase
114
![Page 115: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/115.jpg)
Algorithm Sketch: One phase
115
![Page 116: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/116.jpg)
Algorithm: Analysis Sketch
• Assume n is power of 2 vertex in phase t is a path of 2t nodes; Exactly log n phases
• Show that max matching in phase t is of size ≥ (1 – err(t)) (n/2t)Size of final linear forest ≥ 𝑡 |𝑀𝑡|
≥ 𝑡 1 − 𝑒𝑟𝑟 𝑡𝑛
2𝑡
≥ 𝑛 − 𝑛 𝑡𝑒𝑟𝑟 𝑡
2𝑡
Key technical claim: 𝑒𝑟𝑟 𝑡 ≤ 𝑐2𝑡
2√log 𝑑
√𝑑
Final linear forest size ≥ 𝑛 − 𝑛 𝑡𝑒𝑟𝑟 𝑡
2𝑡 ≥ 𝑛 − 𝑐𝑛√log 𝑑
√𝑑 𝑡
1
2𝑡2
≥ 𝑛 − 𝑐′𝑛√log 𝑑
√𝑑
116
![Page 117: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/117.jpg)
Summary of our approach
• Every d-regular digraph can be covered by
𝑂(𝑛
𝑑) paths. (via improved algorithm)
• Every d-regular graph has a spanning tree with
T = 𝑂(𝑛
𝑑) odd degree vertices.
• There is a T-join with 𝑂 |𝑇| + 𝑂(𝑛
𝑑) edges.
• There is a tour of length n + 𝑂(𝑛
𝑑).
117
![Page 118: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/118.jpg)
More generally
Let G be a connected n-vertex graph with max degree ∆, avg degree d, min degree 𝛿. Then there is a tour of length
1 +∆−𝑑
∆+ 𝑂
1
∆+ 𝑂
1
𝛿𝑛
Moreover, such a tour can be found in random polynomial time.
118
![Page 119: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/119.jpg)
Results
1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes
(WG14, joint with Satoru Iwata and Alantha Newman)
“Regular graphs have short tours”
2. Size 9n/7 in cubic bipartite graphs (APPROX14, joint with Jeremy Karp)
3. Size (1 + 𝑂(1
𝑑))n in d-regular graphs
(IPCO14, joint with Uri Feige and Mohit Singh)
119
![Page 120: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/120.jpg)
Open
• Use Steiner cycles approach for graph-TSP
• Prove Barnette’s conjecture
• Improve additive bound in d-regular graphs
from 𝑂𝑛
𝑑to 𝑂
𝑛
𝑑
• 4/3-approximation for general graph-TSP
120
![Page 121: Improved Approximations for Graph-TSP in Regular Graphsravi/gtsp-talk.pdfResults 1. Size 4n/3 in a graph with a spanning tree and a simple cycle on its odd nodes (WG14, joint with](https://reader035.vdocument.in/reader035/viewer/2022081518/613ac9a5f8f21c0c8268a2a2/html5/thumbnails/121.jpg)
Main ideas for short tours
1. Augment spanning tree with carefully chosen edges
2. Delete carefully chosen edges from the whole graph
3. Augment cycle cover with few cycles
4. Augment path cover with few paths
121