Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract)

Nili Guttmann-Beck; Refael Hassin; Samir Khuller; Balaji Raghavachari

doi:10.1007/978-3-540-49382-2_2

Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract)

Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

Let G = (V,E) be a complete undirected graph with vertex set V , edge set E, and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clusters V₁, . . . , V_k. The clustered traveling salesman problem (CTSP) is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper, we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.

Original language	English (US)
Title of host publication	Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings
Pages	6-17
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-540-49382-2_2
State	Published - Dec 1 1998
Event	18th Foundations of Software Technology and Theoretical Computer Science Conference, FST and TCS 1998 - Chennai, India Duration: Dec 17 1998 → Dec 19 1998

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1530 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th Foundations of Software Technology and Theoretical Computer Science Conference, FST and TCS 1998
Country/Territory	India
City	Chennai
Period	12/17/98 → 12/19/98

ASJC Scopus subject areas

General Computer Science
Theoretical Computer Science

Access to Document

10.1007/978-3-540-49382-2_2

Cite this

Guttmann-Beck, N., Hassin, R., Khuller, S., & Raghavachari, B. (1998). Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract). In Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings (pp. 6-17). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1530 LNCS). https://doi.org/10.1007/978-3-540-49382-2_2

Guttmann-Beck, Nili ; Hassin, Refael ; Khuller, Samir et al. / Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract). Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings. 1998. pp. 6-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e5d94c17613549abb4ae00245bbdd004,

title = "Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract)",

abstract = "Let G = (V,E) be a complete undirected graph with vertex set V , edge set E, and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clusters V1, . . . , Vk. The clustered traveling salesman problem (CTSP) is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper, we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.",

author = "Nili Guttmann-Beck and Refael Hassin and Samir Khuller and Balaji Raghavachari",

year = "1998",

month = dec,

day = "1",

doi = "10.1007/978-3-540-49382-2_2",

language = "English (US)",

isbn = "3540653848",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "6--17",

booktitle = "Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings",

note = "18th Foundations of Software Technology and Theoretical Computer Science Conference, FST and TCS 1998 ; Conference date: 17-12-1998 Through 19-12-1998",

}

Guttmann-Beck, N, Hassin, R, Khuller, S & Raghavachari, B 1998, Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract). in Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1530 LNCS, pp. 6-17, 18th Foundations of Software Technology and Theoretical Computer Science Conference, FST and TCS 1998, Chennai, India, 12/17/98. https://doi.org/10.1007/978-3-540-49382-2_2

Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract). / Guttmann-Beck, Nili; Hassin, Refael; Khuller, Samir et al.
Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings. 1998. p. 6-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1530 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract)

AU - Guttmann-Beck, Nili

AU - Hassin, Refael

AU - Khuller, Samir

AU - Raghavachari, Balaji

PY - 1998/12/1

Y1 - 1998/12/1

N2 - Let G = (V,E) be a complete undirected graph with vertex set V , edge set E, and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clusters V1, . . . , Vk. The clustered traveling salesman problem (CTSP) is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper, we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.

AB - Let G = (V,E) be a complete undirected graph with vertex set V , edge set E, and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clusters V1, . . . , Vk. The clustered traveling salesman problem (CTSP) is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper, we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.

UR - http://www.scopus.com/inward/record.url?scp=84887047650&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887047650&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-49382-2_2

DO - 10.1007/978-3-540-49382-2_2

M3 - Conference contribution

AN - SCOPUS:84887047650

SN - 3540653848

SN - 9783540653844

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

SP - 6

EP - 17

BT - Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings

T2 - 18th Foundations of Software Technology and Theoretical Computer Science Conference, FST and TCS 1998

Y2 - 17 December 1998 through 19 December 1998

ER -

Guttmann-Beck N, Hassin R, Khuller S, Raghavachari B. Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract). In Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings. 1998. p. 6-17. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-49382-2_2

Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract)

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this