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

메뉴 건너뛰기

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 306-312

Approximation algorithms for minimum-cost k-vertex connected subgraphs

(3) Cheriyan, Joseph a Vempala, Santosh a Vetta, Adrian a

a UNIVERSITY OF WATERLOO (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; ITERATIVE METHODS; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHM; HARMONIC NUMBER;

ALGORITHMS;

EID: 0036038426 PISSN: 07349025 EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/509907.509955 Document Type: Conference Paper

Times cited : (44)

References (22)

1
- 0001977155
- A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
- (1999) Journal of Algorithms , vol.32 , pp. 21-30
- Auletta, V.¹ Dinitz, Y.² Nutov, Z.³ Parente, D.⁴

2
- 0005269528
- On rooted node-connectivity problems
- (2001) Algorithmica , vol.30 , pp. 353-375
- Cheriyan, J.¹ Jordan, T.² Nutov, Z.³

3
- 23044525324
- Edge coverings of setpairs and the iterative rounding method, submitted for journal publication, September 2001
- (2001) Preliminary Version in the Proceedings of the 8th International Integer Programming and Combinatorial Optimization Conference, Utrecht, The Netherlands , pp. 30-44
- Cheriyan, J.¹ Vempala, S.²

4
- 0001998507
- Connectivity augmentation problems in network design
- (Eds. J. R. Birge and K. G. Murty); The University of Michigan, Ann Arbor, MI
- (1994) Mathematical Programming: State of the Art 1994 , pp. 34-63
- Frank, A.¹

5
- 0003017893
- Minimal edge-coverings of pairs of sets
- (1995) Journal of Combinatorial Theory, Series B , vol.65 , pp. 73-110
- Frank, A.¹ Jordan, T.²

6
- 0001186361
- An application of submodular flows
- (1989) Linear Algebra and Its Applications , vol.114-115 , pp. 329-348
- Frank, A.¹ Tardos, E.²

7
- 0005342332
- An iterative rounding 2-approximation algorithm for the element connectivity problem
- Proc. 42nd IEEE FOCS, October 2001
- Fleischer, L.¹ Jain, K.² Williamson, D.P.³

8
- 0027242496
- A representation for crossing set families with applications to submodular flow problems
- Proc. 4th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1993 , pp. 202-211
- Gabow, H.N.¹

9
- 0005334415
- Using expander graphs to find vertex connectivity
- Proc. 41st IEEE FOCS, Nov. 2000
- Gabow, H.N.¹

10
- 0028315813
- Improved approximation algorithms for network design problems
- Proc. 5th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1994 , pp. 223-232
- Goemans, M.¹ Goldberg, A.² Plotkin, S.³ Shmoys, D.⁴ Tardos, E.⁵ Williamson, D.⁶

11
- 0029289832
- A general approximation technique for constrained forest problems
- (1995) SIAM Journal on Computing , vol.24 , pp. 296-317
- Goemans, M.¹ Williamson, D.²

12
- 0003957164
- Springer-Verlag, New York
- (1988) Geometric Algorithms and Combinatorial Optimization
- Grötschel, M.¹ Lovász, L.² Schrijver, A.³

13
- 0005363324
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Preliminary version in Proc. 39th IEEE FOCS, 1998
- (2001) Combinatorica , vol.21 , Issue.1 , pp. 39-60
- Jain, K.¹

14
- 0032761912
- A primal-dual schema based approximation algorithm for the element connectivity problem
- Proc. 10th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1999 , pp. 484-489
- Jain, K.¹ Mandoiu, I.² Vazirani, V.V.³ Williamson, D.P.⁴

15
- 0030367201
- Improved approximation algorithms for uniform connectivity problems
- (1996) Journal of Algorithms , vol.21 , pp. 434-450
- Khuller, S.¹ Raghavachari, B.²

16
- 84976736302
- Biconnectivity approximations and graph carvings
- Preliminary version in Proc. 24th STOC, 1992
- (1994) Journal of the ACM , vol.41 , Issue.2 , pp. 214-235
- Khuller, S.¹ Vishkin, U.²

17
- 84937389799
- Approximating node connectivity problems via set covers
- (K. Jansen, S. Khuller (eds.)), Springer, LNCS
- (2000) Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000 , vol.1913 , pp. 194-205
- Kortsarz, G.¹ Nutov, Z.²

18
- 0001011005
- Endlichkeitsätze für k-kristische Graphen
- (German)
- (1977) Math. Ann. , vol.229 , pp. 143-153
- Mader, W.¹

19
- 0002183220
- Connectivity and edge-connectivity in finite graphs
- London Math. Soc. Lecture Note Ser., 38, Cambridge Univ. Press, Cambridge-New York
- (1979) Surveys in Combinatorics (Proc. Seventh British Combinatorial Conf., Cambridge, 1979) , pp. 66-95
- Mader, W.¹

20
- 0002045578
- On k-critically n-connected graphs
- Academic Press, Toronto, ON
- (1984) Progress in Graph Theory (Waterloo, Ont., 1982) , pp. 389-398
- Mader, W.¹

21
- 0347669560
- An approximation algorithm for minimum-cost vertex-connectivity problems
- (Preliminary version in Proc. 6th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 332-341)
- (1997) Algorithmica , vol.18 , pp. 21-43
- Ravi, R.¹ Williamson, D.P.²

22
- 0022672734
- A strongly polynomial algorithm to solve combinatorial linear programs
- (1986) Operations Research , vol.34 , pp. 250-256
- Tardos, E.¹

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