![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/soda/GabowGTW05
@inproceedings{DBLP:conf/soda/GabowGTW05, author = {Harold N. Gabow and Michel X. Goemans and {\'{E}}va Tardos and David P. Williamson}, title = {Approximating the smallest \emph{k}-edge connected spanning subgraph by LP-rounding}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {562--571}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070511}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/GabowGTW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.