Differential approximation for some routing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2653, Issue , 2003, Pages 277-288

  Bazgan, Cristina ^a   Hassin, Refael ^b   Monnot, Jérôme ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithm; Differential ratio; TSP; VRP

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; VEHICLES;

DIFFERENTIAL APPROXIMATIONS; DIFFERENTIAL RATIO; NUMBER OF VEHICLES; ROUTING PROBLEMS; TOTAL DISTANCES; TSP; VEHICLE ROUTING PROBLEMS; VRP;

APPROXIMATION ALGORITHMS;

EID: 21144449451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44849-7_31     Document Type: Article

References (18)

1. G. Ausiello, A. D'Atri and M. Protasi, "Structure preserving reductions among convex optimization problems," Journal of Computing and System Sciences 21 (1980) 136-153.
2. C. Bazgan, Approximation of optimization problems and total function of NP, Ph.D. Thesis (in French), Université Paris Sud (1998).
3. M. Bellmore and S. Hong, "Transformation of Multi-salesmen Problem to the Standard Traveling Salesman Problem," Journal of the Association for Computing Machinery 21 (1974) 500-504.
4. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver Combinatorial Optimization John Wiley & Sons Inc New York 1998 (Chapter 5.5).
5. M. Demange and V. Paschos, "On an approximation measure founded on the links between optimization and polynomial approximation theory," Theoretical Computer Science 158 (1996) 117-141.
6. L. Engebretsen and M. Karpinski, "Approximation hardness of TSP with bounded metrics," http://www.nada.kth.se/∼enge/papers/BoundedTSP.pdf
7. M. R. Garey and D. S. Johnson, "Computers and intractability. A guide to the theory of NP-completeness," Freeman, C.A. San Francisco (1979).
8. M. Haimovich and A. H. G. Rinnooy Kan, "Bounds and heuristics for capacitated routing problems," Mathematics of Operations Research 10 (1985) 527-542.
9. M. Haimovich, A. H. G. Rinnooy Kan and L. Stougie, " Analysis of Heuristics for Vehicle Routing Problems," in Vehicle Routing Methods and Studies, Golden, Assad editors, Elsevier (1988) 47-61.
10. D. Hartvigsen, Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984).
11. R. Hassin and S. Khuller, "z-approximations," Journal of Algorithms 41 (2001) 429-442.
12. D. G. Kirkpatrick and P. Hell, "On the completeness of a generalized matching problem," Proc. of the 10th ACM Symposium on Theory and Computing (1978) 240-245.
13. C-L. Li, D. Simchi-Levi and M. Desrochers, "On the distance constrained vehicle routing problem," Operations Research 40 4(1992) 790-799.
14. J. Monnot, "Differential approximation results for the traveling salesman and related problems," Information Processing Letters 82 (2002) 229-235.
15. J. Monnot, V. Th. Paschos and S. Toulouse, "Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2," Proc. FCT (2001) 275-286.
16. C. Papadimitriou and M. Yannakakis, "The traveling salesman problem with distances one and two," Mathematics of Operations Research 18(1) (1993) 1-11.
17. S. Sahni and T. Gonzalez, "P-complete approximation problems" Journal of the Association for Computing Machinery 23 (1976) 555-565.
18. E. Zemel, "Measuring the quality of approximate solution to zero-one programming problems," Mathematical Operations Research 6(1981) 319-332.