BibTeX record conf/stoc/KonemannR00

download as .bib file

@inproceedings{DBLP:conf/stoc/KonemannR00,
  author       = {Jochen K{\"{o}}nemann and
                  R. Ravi},
  editor       = {F. Frances Yao and
                  Eugene M. Luks},
  title        = {A matter of degree: improved approximation algorithms for degree-bounded
                  minimum spanning trees},
  booktitle    = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
                  of Computing, May 21-23, 2000, Portland, OR, {USA}},
  pages        = {537--546},
  publisher    = {{ACM}},
  year         = {2000},
  url          = {https://doi.org/10.1145/335305.335371},
  doi          = {10.1145/335305.335371},
  timestamp    = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KonemannR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics