32-approximation algorithm for two variants of a 2-depot Hamiltonian path problem

Authors:
Sivakumar Rathinam;Raja Sengupta
Affiliations:
Mechanical Engineering, Texas A & M University, College Station, TX 77843, United States;Department of Civil Engineering, University of California, Berkeley, CA 94720, United States
Venue:
Operations Research Letters
Year:
2010

Citing 5
Cited 3

A matroid algorithm and its application to the efficient solution of two optimization problems on graphs

Mathematical Programming: Series A and B
Matroids and a forest cover problem

Mathematical Programming: Series A and B
On the complexity of graph tree partition problems

Discrete Applied Mathematics
An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem

Operations Research Letters
Analysis of Christofides' heuristic: Some paths are more difficult than cycles

Operations Research Letters

A 3/2-approximation algorithm for multiple depot multiple traveling salesman problem

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An analysis of the extended Christofides heuristic for the k-depot TSP

Operations Research Letters
Cyber-physical cloud computing: the binding and migration problem

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider two variants of a 2-depot Hamiltonian path problem and show that they have an algorithm with an approximation ratio of 32 if the costs are symmetric and satisfy the triangle inequality. This improves the 2-approximation algorithm already available for the problem.