A 4/3-approximation for TSP on cubic 3-edge-connected graphs
Year of publication: |
July 2018
|
---|---|
Authors: | Agarwal, Nishita ; Garg, Naveen ; Gupta, Swati |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 46.2018, 4, p. 393-396
|
Subject: | Traveling salesman problem | Cubic graphs | 4/3 approximation | Cycle covers | Rundreiseproblem | Travelling salesman problem | Graphentheorie | Graph theory | Tourenplanung | Vehicle routing problem |
-
The Traveling Backpacker Problem : a computational comparison of two formulations
Nakamura, Kátia Y., (2018)
-
Approximation hardness of graphic TSP on cubic graphs
Karpiński, Marek, (2015)
-
Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
Jevtić, Petar, (2015)
- More ...
-
On the single-source unsplittable flow problem
DINITZ, Yefim,
-
On the single-source unsplittable flow problem
DINITZ, Yefim,
-
Passive noise control measures for traffic noise abatement in Delhi, India
Garg, Naveen, (2012)
- More ...