Approximating the smallest k -edge connected spanning subgraph by LP-rounding

From MaRDI portal
Publication:3057092

DOI10.1002/net.20289zbMath1205.05125OpenAlexW4240507476WikidataQ101127553 ScholiaQ101127553MaRDI QIDQ3057092

Éva Tardos, Harold N. Gabow, Michel X. Goemans, David P. Williamson

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20289




Related Items (16)



Cites Work


This page was built for publication: Approximating the smallest k -edge connected spanning subgraph by LP-rounding