SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 15, Issue 3, 1995, Pages 435-454

A primal-dual approximation algorithm for generalized steiner network problems

(4) Williamson, David P a Goemans, Michel X b Mihail, Milena c Vazirani, Vijay V d

a IBM T J WATSON RESEARCH CENTER (United States)

b MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

c TELCORDIA TECHNOLOGIES (United States)

d INDIAN INSTITUTE OF TECHNOLOGY DELHI (India)

Author keywords

Mathematics Subject Classification (1991): 05C40, 68Q25, 90C10, 90C35

Indexed keywords

EID: 0001401957 PISSN: 02099683 EISSN: 14396912 Source Type: Journal
DOI: 10.1007/BF01299747 Document Type: Article

Times cited : (117)

References (17)

1
- 84931477410
- A. Agrawal, P. Klein, and R. Ravi: “When trees collide: An approximation algorithm for the generalized Steiner problem in networks”, Proc. 23rd ACM Symp. on Theory of Computing, 134–144 (1991).

2
- 84931422062
- P. Berman and V. Ramaiyer: “Improved approximations for the Steiner tree problem”, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 325–334 (1992).

3
- 0000951232
- Worst-case analysis of greedy heuristics for integer programming with non-negative data
- (1982) Mathematics of Operations Research , vol.7 , pp. 515-531
- Dobson, G.¹

4
- 0001272011
- Approximation algorithms for several graph augmentation problems
- (1981) SIAM Journal on Computing , vol.10 , pp. 270-283
- Frederickson, G.N.¹ Ja'Ja', J.²

5
- 84931297995
- H. N. Gabow, M. X. Goemans, and D. P. Williamson: “An Efficient Approximation algorithm for the survivable network design problem”, Proc. Third Conference on Integer Programming and Combinatorial Optimization, 57–74 (1993).

6
- 0000875467
- Survivable networks, linear programming relaxations and the parsimonious property
- (1993) Math. Programming , vol.60 , pp. 145-166
- Goemans, M.X.¹ Bertsimas, D.J.²

7
- 84931381533
- M. X. Goemans, A. V. Goldberg, S. Plotkin, D. B. Shmoys, É. Tardos and D. P. Williamson: “Improved approximation algorithms for network design problems”, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 223–232 (1994).

8
- 84931465589
- M. X. Goemans and D. P. Williamson: “A general approximation technique for constrained forest problems”, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 307–316 (1992). To appear in SIAM J. on Comput.

9
- 84931332288
- M. Grötschel, C. L. Monma and M. Stoer: “Design of survivable networks”, to appear in the Handbook in Operations Research and Management Science, Eds: Michael Ball, Thomas Magnanti, Clyde Monma, and George Nemhauser (1992).

10
- 0022785612
- A fast approximation algorithm for the multicovering problem
- (1986) Disc. Appl. Math. , vol.15 , pp. 35-40
- Hall, N.G.¹ Hochbaum, D.S.²

11
- 84931435279
- S. Khuller and U. Vishkin: “Biconnectivity approximations and graph carvings”, Technical Report UMIACS-TR-91-132, Univ. of Maryland (September 1991). Also appears in Proc. 24th ACM Symp. on Theory of Computing, 759–770 (1992).

12
- 84931417215
- P. Klein and R. Ravi: “When cycles collapse: A general approximation technique for constrained two-connectivity problems”, Proc. Third Conference on Integer Programming and Combinatorial Optimization, 39–55 (1993).

13
- 84931329279
- D. Naor, D. Gusfield, and C. Martel: “A fast algorithm for optimally increasing the edge-connectivity”, Proc. 31st Annual Symp. on Foundations of Computer Science, 698–707 (1990).

14
- 0003725604
- Prentice-Hall, Englewood Cliffs, NJ
- (1982) Combinatorial Optimization: Algorithms and Complexity
- Papadimitriou, C.H.¹ Steiglitz, K.²

15
- 84931413592
- S. Rajagopalan and V. V. Vazirani: “Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs”, Proc. 34th Annual Symp. on Foundations of Computer Science, 322–331 (1993).

16
- 84931318169
- H. Saran, V. Vazirani, and N. Young: “A primal-dual approach to approximation algorithms for network Steiner problems”, Proc. of Indo-US workshop on Cooperative Research in Computer Science, Bangalore, India, 166–168 (1992).

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

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