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

Authors:
Waqar Malik;Sivakumar Rathinam;Swaroop Darbha
Affiliations:
Department of Mechanical Engineering, Texas A&M University, College Station, TX 77843, USA;Department of Civil Engineering, University of California-Berkeley, CA 94720, USA;Department of Mechanical Engineering, Texas A&M University, College Station, TX 77843, USA
Venue:
Operations Research Letters
Year:
2007

Citing 8
Cited 8

Approximation algorithms

Approximation algorithms
The Constrained Minimum Spanning Tree Problem (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
A Faster Deterministic Algorithm for Minimum Spanning Trees

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds

SIAM Journal on Computing
Minimum Bounded Degree Spanning Trees

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
The traveling salesman: computational solutions for TSP applications

The traveling salesman: computational solutions for TSP applications
What would edmonds do? augmenting paths and witnesses for degree-bounded MSTs

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
A push-relabel algorithm for approximating degree bounded MSTs

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem

ACC'09 Proceedings of the 2009 conference on American Control Conference
An approximation algorithm for a 2-depot, heterogeneous vehicle routing problem

ACC'09 Proceedings of the 2009 conference on American Control Conference
A transformation for a multiple depot, multiple traveling salesman problem

ACC'09 Proceedings of the 2009 conference on American Control Conference
Approximation algorithms for min-max capacitated path covers

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
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
32-approximation algorithm for two variants of a 2-depot Hamiltonian path problem

Operations Research Letters
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm with an approximation factor of 2 for a Generalized, Multiple Depot, Multiple Travelling Salesman Problem (GMTSP) when the costs are symmetric and satisfy the triangle inequality. The algorithm requires finding a degree constrained minimum spanning tree which we compute using a Lagrangian relaxation.