SCOPUS 정보 검색 플랫폼

Networks

Volumn 31, Issue 4, 1998, Pages 283-292

Approximating Steiner trees in graphs with restricted weights

(4) Halldórsson, Magnús M a Ueno, Shuichi b Nakao, Hiroshi b Kajitani, Yoji b

a UNIVERSITY OF ICELAND (Iceland)

b TOKYO INSTITUTE OF TECHNOLOGY (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041173672 PISSN: 00283045 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1097-0037(199807)31:4<283::AID-NET8>3.0.CO;2-9 Document Type: Article

Times cited : (4)

References (10)

1
- 0002566799
- Derandomized graph products
- N. Alon, U. Feige, A. Wigderson, and D. Zuckerman, Derandomized graph products. Comput. Complex. 5 (1995) 60-75.
- (1995) Comput. Complex , vol.5 , pp. 60-75
- Alon, N.¹ Feige, U.² Wigderson, A.³ Zuckerman, D.⁴

2
- 0000785722
- Improved approximations for the steiner tree problem
- P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem. J. Alg. 17 (1994) 381-408.
- (1994) J. Alg. , vol.17 , pp. 381-408
- Berman, P.¹ Ramaiyer, V.²

3
- 0024735782
- The steiner problem with edge lengths 1 and 2
- M. Bern and P. Plassman, The Steiner problem with edge lengths 1 and 2. Info. Process. Lett. 32 (1989) 171-176.
- (1989) Info. Process. Lett. , vol.32 , pp. 171-176
- Bern, M.¹ Plassman, P.²

4
- 0030386107
- 1-∈
- Oct.
- 1-∈. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (Oct. 1996) 627-636.
- (1996) Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science , pp. 627-636
- Håstad, J.¹

5
- 0001326115
- The hardness of approximation: Gap location
- E. Petrank, The hardness of approximation: Gap location. Comput. Complex. 4 (1994) 133-157.
- (1994) Comput. Complex , vol.4 , pp. 133-157
- Petrank, E.¹

6
- 0003147681
- The computation of nearly minimal Steiner trees in graphs
- V. J. Rayward-Smith, The computation of nearly minimal Steiner trees in graphs. Int. J. Math. Ed. Sci. Tech. 14 (1983) 15-23.
- (1983) Int. J. Math. Ed. Sci. Tech. , vol.14 , pp. 15-23
- Rayward-Smith, V.J.¹

7
- 0039003360
- Technical Report WUCS-88-4 Dept. Computer Science, Washington University, St. Louis, MO
- B. M. Waxman, Probable performance of Steiner tree algorithms. Technical Report WUCS-88-4. Dept. Computer Science, Washington University, St. Louis, MO (1988).
- (1988) Probable Performance of Steiner Tree Algorithms
- Waxman, B.M.¹

8
- 0024282074
- Worst-case performance of Rayward-Smith's Steiner tree heuristic
- B. M. Waxman and M. Imase, Worst-case performance of Rayward-Smith's Steiner tree heuristic. Info. Process. Lett. 29 (1988) 283-287.
- (1988) Info. Process. Lett. , vol.29 , pp. 283-287
- Waxman, B.M.¹ Imase, M.²

9
- 52449147871
- Path-distance heuristics for the steiner problem in undirected networks
- P. Winter and J. M. Smith, Path-distance heuristics for the Steiner problem in undirected networks. Algorithmica 7 (1992) 309-327.
- (1992) Algorithmica , vol.7 , pp. 309-327
- Winter, P.¹ Smith, J.M.²

10
- 0000857177
- An 11/6-approximation algorithm for the network Steiner problem
- A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem. Algorithmica 9 (1993) 463-470.
- (1993) Algorithmica , vol.9 , pp. 463-470
- Zelikovsky, A.¹

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