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

메뉴 건너뛰기

Mathematics of Operations Research

Volumn 29, Issue 3, 2004, Pages 436-461

Rounding algorithms for a geometric embedding of minimum multiway cut

(5) Karger, David R a Klein, Philip b Stein, Cliff c Thorup, Mikkel d Young, Neal E e

a MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

b Brown Univerity (United States)

c Columbia University ^* (United States)

d AT AND T LABS RESEARCH (United States)

e University of California Riverside (United States)

Author keywords

Approximation algorithm; Multiway cut

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; THEOREM PROVING;

APPROXIMATION ALGORITHM; MULTIWAY CUT;

OPERATIONS RESEARCH;

EID: 5544261007 PISSN: 0364765X EISSN: None Source Type: Journal
DOI: 10.1287/moor.1030.0086 Document Type: Article

Times cited : (90)

References (9)

1
- 0000927271
- An O(log k) approximate min-cut max-flow theorem and approximation algorithm
- Aumann, Yonatan, Yuval Rabani. 1998. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput. 27(1) 291-301.
- (1998) SIAM J. Comput. , vol.27 , Issue.1 , pp. 291-301
- Aumann, Y.¹ Rabani, Y.²

2
- 0004302610
- John Wiley and Sons, New York
- Billingsley, Patrick. 1995. Probability and Measure. John Wiley & Sons, New York.
- (1995) Probability and Measure
- Billingsley, P.¹

3
- 0034206424
- An improved approximation algorithm for multiway cut
- Calinescu, G., H. Karloff, Y. Rabani. 2000. An improved approximation algorithm for Multiway Cut. J. Comput. System Sci. 60(3) 564-574.
- (2000) J. Comput. System Sci. , vol.60 , Issue.3 , pp. 564-574
- Calinescu, G.¹ Karloff, H.² Rabani, Y.³

4
- 84948964973
- Optimal 3-terminal cuts and linear programming
- Springer-Verlag
- Cunningham, W. H, L. Tang. 1999. Optimal 3-terminal cuts and linear programming. Proc. Seventh Conf. Integer Programming Combin. Optim. (IPCO), Lecture Notes in Computer Science, Vol. 1610. Springer-Verlag, 114-125.
- (1999) Proc. Seventh Conf. Integer Programming Combin. Optim. (IPCO), Lecture Notes in Computer Science , vol.1610 , pp. 114-125
- Cunningham, W.H.¹ Tang, L.²

5
- 0028484228
- The complexity of multi-terminal cuts
- Dahlhaus, E., D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis. 1994. The complexity of multi-terminal cuts. SIAM J. Comput. 23(4) 864-894.
- (1994) SIAM J. Comput. , vol.23 , Issue.4 , pp. 864-894
- Dahlhaus, E.¹ Johnson, D.S.² Papadimitriou, C.H.³ Seymour, P.D.⁴ Yannakakis, M.⁵

6
- 0001545727
- Divide-and-conquer approximation algorithms via spreading metrics
- Even, Guy, Joseph (Seffi) Naor, Satish Rao, Baruch Schieber. 2000. Divide-and-conquer approximation algorithms via spreading metrics. J. Assoc. Comput. Machinery 47(4) 585-616.
- (2000) J. Assoc. Comput. Machinery , vol.47 , Issue.4 , pp. 585-616
- Even, G.¹ Naor, J.S.² Rao, S.³ Schieber, B.⁴

7
- 84893574327
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Goemans, Michel X., David P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Machinery 42(6) 1115-1145.
- (1995) J. Assoc. Comput. Machinery , vol.42 , Issue.6 , pp. 1115-1145
- Goemans, M.X.¹ Williamson, D.P.²

8
- 0000651166
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Leighton, F. T., S. Rao. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. Assoc. Comput. Machinery 46(6) 787-832.
- (1999) J. Assoc. Comput. Machinery , vol.46 , Issue.6 , pp. 787-832
- Leighton, F.T.¹ Rao, S.²

9
- 0000652415
- The geometry of graphs and some of its algorithmic applications
- Linial, Nathan, Eran London, Yuri Rabinovich. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica
- (1995) Combinatorica , vol.15 , Issue.2 , pp. 215-245
- Linial, N.¹ London, E.² Rabinovich, Y.³

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