"Iterated rounding algorithms for the smallest k-edge connected ..."

Harold N. Gabow, Suzanne Gallagher (2008)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/GabowG08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GabowG08
Harold N. Gabow, Suzanne Gallagher:
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph. SODA 2008: 550-559

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.