A 4/3-approximation for TSP on cubic 3-edge-connected graphs
Data Structures and Algorithms
2011-01-31 v1
Abstract
We provide a polynomial time 4/3 approximation algorithm for TSP on metrics arising from the metric completion of cubic 3-edge connected graphs.
Cite
@article{arxiv.1101.5586,
title = {A 4/3-approximation for TSP on cubic 3-edge-connected graphs},
author = {Nishita Aggarwal and Naveen Garg and Swati Gupta},
journal= {arXiv preprint arXiv:1101.5586},
year = {2011}
}
Related papers
View all related →
Discrete Mathematics · Computer Science
Graphic TSP in cubic graphs
Zdenek Dvorak, Daniel Kral, Bojan Mohar
2016-09-06
Data Structures and Algorithms · Computer Science
The traveling salesman problem on cubic and subcubic graphs
Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
2011-07-07
Data Structures and Algorithms · Computer Science
4/3-Approximation of Graphic TSP
Ali Çivril
2024-11-05
Data Structures and Algorithms · Computer Science
A 9/7-Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
Jeremy Karp, R. Ravi
2014-11-04
Discrete Mathematics · Computer Science
Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
András Sebő, Jens Vygen
2012-09-18
Data Structures and Algorithms · Computer Science
TSP Tours in Cubic Graphs: Beyond 4/3
José R. Correa, Omar Larré, José A. Soto
2013-10-08
Computational Complexity · Computer Science
Approximation Hardness of Graphic TSP on Cubic Graphs
Marek Karpinski, Richard Schmied
2013-05-15
Discrete Mathematics · Computer Science
Beating the integrality ratio for s-t-tours in graphs
Vera Traub, Jens Vygen
2018-09-18
Data Structures and Algorithms · Computer Science
Improved Approximations for Cubic and Cubic Bipartite TSP
Anke van Zuylen
2016-06-27
Data Structures and Algorithms · Computer Science
Approximating Graphic TSP by Matchings
Tobias Mömke, Ola Svensson
2015-03-19
Data Structures and Algorithms · Computer Science
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
Babak Ghanbari, Robert Šámal
2025-07-03
Data Structures and Algorithms · Computer Science
A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
Babak Ghanbari, Robert Šámal
2026-05-04
Data Structures and Algorithms · Computer Science
A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem
Ali Çivril
2023-05-10
Data Structures and Algorithms · Computer Science
A (Slightly) Improved Approximation Algorithm for Metric TSP
Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan
2023-10-26
Data Structures and Algorithms · Computer Science
Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs
Baigong Zheng
2017-01-31
Data Structures and Algorithms · Computer Science
Computing the $4$-Edge-Connected Components of a Graph in Linear Time
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2021-05-10
Data Structures and Algorithms · Computer Science
A $4/3$ Approximation for $2$-Vertex-Connectivity
Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
2025-07-02
Data Structures and Algorithms · Computer Science
A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
Ali Çivril
2024-07-16
Data Structures and Algorithms · Computer Science
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
Qiaoming Han, Abraham P. Punnen, Yinyu Ye
2007-12-21
Data Structures and Algorithms · Computer Science
Improved Linear-Time Algorithm for Computing the $4$-Edge-Connected Components of a Graph
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2021-08-20
Data Structures and Algorithms · Computer Science
Determining 4-edge-connected components in linear time
Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokołowski
2021-05-06
Data Structures and Algorithms · Computer Science
An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality
Tobias Mömke
2014-12-23
Discrete Mathematics · Computer Science
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP
Vera Traub, Jens Vygen
2019-07-24
Data Structures and Algorithms · Computer Science
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
2023-03-03
Numerical Analysis · Mathematics
On Optimization of 1/2-Approximation Path Cover Algorithm
Junyuan Lin, Guangpeng Ren
2021-01-25