%0 Conference Paper %1 conf/soda/Vetta01 %A Vetta, Adrian %B SODA %D 2001 %E Kosaraju, S. Rao %I ACM/SIAM %K dblp %P 417-426 %T Approximating the minimum strongly connected subgraph via a matching lower bound. %U http://dblp.uni-trier.de/db/conf/soda/soda2001.html#Vetta01 %@ 0-89871-490-7

@inproceedings{conf/soda/Vetta01, added-at = {2012-12-07T00:00:00.000+0100}, author = {Vetta, Adrian}, biburl = {https://www.bibsonomy.org/bibtex/2529d4cebdbee9e4d772401dbc73e0492/dblp}, booktitle = {SODA}, crossref = {conf/soda/2001}, editor = {Kosaraju, S. Rao}, ee = {http://dl.acm.org/citation.cfm?id=365411.365493}, interhash = {24cbe4ed90567f5ddfb44bdac92d1d4f}, intrahash = {529d4cebdbee9e4d772401dbc73e0492}, isbn = {0-89871-490-7}, keywords = {dblp}, pages = {417-426}, publisher = {ACM/SIAM}, timestamp = {2012-12-08T11:43:41.000+0100}, title = {Approximating the minimum strongly connected subgraph via a matching lower bound.}, url = {http://dblp.uni-trier.de/db/conf/soda/soda2001.html#Vetta01}, year = 2001 }