BibTeX record conf/stoc/KortsarzN04

download as .bib file

@inproceedings{DBLP:conf/stoc/KortsarzN04,
  author       = {Guy Kortsarz and
                  Zeev Nutov},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Approximation algorithm for k-node connected subgraphs via critical
                  graphs},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {138--145},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007381},
  doi          = {10.1145/1007352.1007381},
  timestamp    = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KortsarzN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics