%0 Journal Article %1 journals/networks/GabowGTW09 %A Gabow, Harold N. %A Goemans, Michel X. %A Tardos, Éva %A Williamson, David P. %D 2009 %J Networks %K dblp %N 4 %P 345-357 %T Approximating the smallest k-edge connected spanning subgraph by LP-rounding. %U http://dblp.uni-trier.de/db/journals/networks/networks53.html#GabowGTW09 %V 53

@article{journals/networks/GabowGTW09, added-at = {2009-05-08T00:00:00.000+0200}, author = {Gabow, Harold N. and Goemans, Michel X. and Tardos, Éva and Williamson, David P.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2d75c3fcdee50b495849f482ad952e393/dblp}, ee = {http://dx.doi.org/10.1002/net.20289}, interhash = {5dde8e434be01d365b2d9c0fd6a656ba}, intrahash = {d75c3fcdee50b495849f482ad952e393}, journal = {Networks}, keywords = {dblp}, number = 4, pages = {345-357}, timestamp = {2016-02-02T09:49:58.000+0100}, title = {Approximating the smallest k-edge connected spanning subgraph by LP-rounding.}, url = {http://dblp.uni-trier.de/db/journals/networks/networks53.html#GabowGTW09}, volume = 53, year = 2009 }