SCOPUS 정보 검색 플랫폼

Volumn 2462, Issue , 2002, Pages 175-184

Minimum restricted diameter spanning trees

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION;

ISOLATED VERTICES; MAXIMUM DISTANCE; PERFORMANCE GUARANTEES; POLYNOMIAL-TIME ALGORITHMS; SPANNING TREE; SPANNING TREE PROBLEMS;

TREES (MATHEMATICS);

EID: 58149530681 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-45753-4_16 Document Type: Conference Paper

Times cited : (8)

References (13)

1
- 0029249995
- A graph theoretic game and its application to the k-server problem
- N. Alon, R. Karp, D. Peleg and D. West, “A graph theoretic game and its application to the k-server problem”, SIAMJ. Comput., 24, 78-100, 1995.
- (1995) SIAMJ. Comput , vol.24 , pp. 78-100
- Alon, N.¹ Karp, R.² Peleg, D.³ West, D.⁴

2
- 0030393774
- Probabilistic approximation of metric spaces and its algorithmic applications
- Y. Bartal, “Probabilistic approximation of metric spaces and its algorithmic applications”, Proceedings of FOCS1996, pages 184-193.
- Proceedings of FOCS , vol.1996 , pp. 184-193
- Bartal, Y.¹

3
- 0031623888
- On approximating arbitrary metrics by tree metrics
- Y. Bartal, “On approximating arbitrary metrics by tree metrics”, Proceedings of STOC1998, pages 161-168.
- Proceedings of STOC , vol.1998 , pp. 161-168
- Bartal, Y.¹

4
- 0031641921
- Rounding via trees: Deterministic approximation algorithms for group steiner trees and k-median
- M. Charikar, C. Chekuri, A. Goel and S. Guha, “Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median”, Proceedings of STOC1998, pages 114-123.
- Proceedings of STOC , vol.1998 , pp. 114-123
- Charikar, M.¹ Chekuri, C.² Goel, A.³ Guha, S.⁴

5
- 65549088171
- Steiner points in tree metrics dont (Really) help
- A. Gupta, “Steiner points in tree metrics don’t (really) help”, Proceeding of SODA2001, pages 220-227.
- Proceeding of SODA , vol.2001 , pp. 220-227
- Gupta, A.¹

6
- 0003603813
- W.H. Freeman and Company
- M. R. Garey and D. S. Johnson, “Computers and intractability: a guide to the theory of NP-completeness”, W.H. Freeman and Company, 1979.
- (1979) Computers and Intractability: A Guide to the Theory of Np-Completeness
- Garey, M.R.¹ Johnson, D.S.²

7
- 0029219324
- On the minimum diameter spanning tree problem
- R. Hassin and A. Tamir, “On the minimum diameter spanning tree problem”, IPL, 53, 109-111, 1995.
- (1995) IPL , vol.53 , pp. 109-111
- Hassin, R.¹ Tamir, A.²

8
- 0003780715
- Addison-Wesley
- F. Harary, “Graph theory”, Addison-Wesley, 1969.
- (1969) Graph Theory
- Harary, F.¹

9
- 0026239340
- Minimum diameter spanning trees and related problems
- J.-M. Ho, D. T. Lee, C.-H. Chang, and C. K. Wong, “Minimum diameter spanning trees and related problems”, SIAMJ. Comput., 20 (5), 987-997, 1991.
- (1991) SIAMJ. Comput , vol.20 , Issue.5 , pp. 987-997
- Ho, J.-M.¹ Lee, D.T.² Chang, C.-H.³ Wong, C.K.⁴

10
- 0028768199
- Designing multi-commodity flow trees
- S. Khuller, B. Raghavachari and N. Young, “Designing multi-commodity flow trees”, IPL, 50, 49-55, 1994.
- (1994) IPL , vol.50 , pp. 49-55
- Khuller, S.¹ Raghavachari, B.² Young, N.³

11
- 84878553288
- Deterministic polylog approximation for minimum communication spanning trees
- D. Peleg and E. Reshef, “Deterministic polylog approximation for minimum communication spanning trees”, Proceedings of ICALP1998, pages 670-681.
- Proceedings of ICALP , vol.1998 , pp. 670-681
- Peleg, D.¹ Reshef, E.²

12
- 0038521887
- Call routing and the rat catcher
- P. Seymour and R. Thomas, “Call routing and the rat catcher”, Combinatorica, 14, 217-241, 1994.
- (1994) Combinatorica , vol.14 , pp. 217-241
- Seymour, P.¹ Thomas, R.²

13
- 4243344590
- A. Tamir, Private communication, 2001.
- (2001) Private Communication
- Tamir, A.¹

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