BibTeX record conf/soda/McCormickS00

download as .bib file

@inproceedings{DBLP:conf/soda/McCormickS00,
  author       = {S. Thomas McCormick and
                  Akiyoshi Shioura},
  editor       = {David B. Shmoys},
  title        = {Minimum ratio canceling is oracle polynomial for linear programming,
                  but not strongly polynomial, even for networks},
  booktitle    = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  pages        = {944--952},
  publisher    = {{ACM/SIAM}},
  year         = {2000},
  url          = {http://dl.acm.org/citation.cfm?id=338219.338663},
  timestamp    = {Fri, 07 Dec 2012 17:02:09 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/McCormickS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}