"Approximation algorithms for minimum-cost k-vertex connected subgraphs."

Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta (2002)

> Home

Details and statistics

DOI: 10.1145/509907.509955

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/CheriyanVV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/CheriyanVV02
Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta:
Approximation algorithms for minimum-cost k-vertex connected subgraphs. STOC 2002: 306-312

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.