BibTeX record conf/stoc/GuruswamiKRSY99

download as .bib file

@inproceedings{DBLP:conf/stoc/GuruswamiKRSY99,
  author       = {Venkatesan Guruswami and
                  Sanjeev Khanna and
                  Rajmohan Rajaraman and
                  F. Bruce Shepherd and
                  Mihalis Yannakakis},
  editor       = {Jeffrey Scott Vitter and
                  Lawrence L. Larmore and
                  Frank Thomson Leighton},
  title        = {Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint
                  Paths and Related Problems},
  booktitle    = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages        = {19--28},
  publisher    = {{ACM}},
  year         = {1999},
  url          = {https://doi.org/10.1145/301250.301262},
  doi          = {10.1145/301250.301262},
  timestamp    = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/GuruswamiKRSY99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics