BibTeX record conf/stacs/ElkinP00

download as .bib file

@inproceedings{DBLP:conf/stacs/ElkinP00,
  author       = {Michael Elkin and
                  David Peleg},
  editor       = {Horst Reichel and
                  Sophie Tison},
  title        = {The Hardness of Approximating Spanner Problems},
  booktitle    = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
                  Science, Lille, France, February 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1770},
  pages        = {370--381},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-46541-3\_31},
  doi          = {10.1007/3-540-46541-3\_31},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/ElkinP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.