SCOPUS 정보 검색 플랫폼

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 852-857

Light spanners and approximate TSP in weighted graphs with forbidden minors

(2) Grigni, Michelangelo a Sissokho, Papa a

a EMORY UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

EDGE-WEIGHTED GRAPH; GREEDY ALGORITHMS; MINIMUM SPANNING TREES; POSITIVE CONSTANT; QUASI-POLYNOMIAL TIME; RUNNING TIME; SHORTEST PATH; WEIGHTED GRAPH;

GRAPH THEORY;

EID: 84968750689 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (25)

References (9)

1
- 0039227987
- On sparse spanners of weighted graphs
- An early version appeared in SWAT'90, LNCS V. 447
- I. Althofer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9(1):81-100, 1993. An early version appeared in SWAT'90, LNCS V. 447.
- (1993) Discrete Comput. Geom. , vol.9 , Issue.1 , pp. 81-100
- Althofer, I.¹ Das, G.² Dobkin, D.P.³ Joseph, D.⁴ Soares, J.⁵

2
- 0032266869
- A polynomial-time approximation scheme for weighted planar graph TSP
- S. Arora, M. Grigni, D. Karger, P. Klein, and A. Woloszyn. A polynomial-time approximation scheme for weighted planar graph TSP. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 33-41, 1998.
- (1998) Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 33-41
- Arora, S.¹ Grigni, M.² Karger, D.³ Klein, P.⁴ Woloszyn, A.⁵

3
- 0003677229
- Springer-Verlag, New York
- R. Diestel. Graph theory. Springer-Verlag, New York, 1997.
- (1997) Graph Theory
- Diestel, R.¹

4
- 0038099322
- Diameter and treewidth in minor-closed graph families
- Special issue on treewidth, graph minors, and algorithms
- D. Eppstein. Diameter and treewidth in minor-closed graph families. AIgorithmica, 27:275-291, 2000. Special issue on treewidth, graph minors, and algorithms.
- (2000) AIgorithmica , vol.27 , pp. 275-291
- Eppstein, D.¹

5
- 84974597124
- Approximate TSP in graphs with forbidden minors
- Lecture Notes in Computer Science. SpringerVerlag, July
- M. Grigni. Approximate TSP in graphs with forbidden minors. In Automata, Languages and Programming: 27th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 869-877. SpringerVerlag, July 2000.
- (2000) Automata, Languages and Programming: 27th International Colloquium , vol.510 , pp. 869-877
- Grigni, M.¹

6
- 0029488567
- An approximation scheme for planar graph TSP
- IEEE, Oct.
- M. Grigni, E. Koutsoupias, and C. Papadimitriou. An approximation scheme for planar graph TSP. In 28th Annual Symposium on Foundations of Computer Science, pages 640-646. IEEE, Oct. 1995.
- (1995) 28th Annual Symposium on Foundations of Computer Science , pp. 640-646
- Grigni, M.¹ Koutsoupias, E.² Papadimitriou, C.³

7
- 0003589271
- Johns Hopkins, University Press, Baltimore
- B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, Baltimore, 2001.
- (2001) Graphs on Surfaces.
- Mohar, B.¹ Thomassen, C.²

8
- 0001805669
- The Traveling Salesman Problem with distances one and two
- C. H. Papadimitriou and M. Yannakakis. The Traveling Salesman Problem with distances one and two. Mathematics of Operations Research, 18:1-11, 1993.
- (1993) Mathematics of Operations Research , vol.18 , pp. 1-11
- Papadimitriou, C.H.¹ Yannakakis, M.²

9
- 84976013923
- An extremal function for contractions of graphs
- A. Thomason. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc., 95(2):261-265, 1984.
- (1984) Math. Proc. Cambridge Philos. Soc. , vol.95 , Issue.2 , pp. 261-265
- Thomason, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.