"Approximating Minimum-Cost k-Node Connected Subgraphs via ..."

Joseph Cheriyan, László A. Végh (2014)

> Home

Details and statistics

DOI: 10.1137/120902847

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/CheriyanV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/CheriyanV14
Joseph Cheriyan, László A. Végh:
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. SIAM J. Comput. 43(4): 1342-1362 (2014)

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.