"An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems."

R. Ravi, David P. Williamson (1997)

> Home

Details and statistics

DOI: 10.1007/BF02523686

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/RaviW97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/RaviW97
R. Ravi, David P. Williamson:
An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica 18(1): 21-43 (1997)

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.