"Approximating the smallest k-edge connected spanning subgraph by ..."

Harold N. Gabow et al. (2009)

> Home

Details and statistics

DOI: 10.1002/NET.20289

access: closed

type: Journal Article

metadata version: 2020-12-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/GabowGTW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/GabowGTW09
Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks 53(4): 345-357 (2009)

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.