Michael Elkin, David Peleg. Strong Inapproximability of the Basic ::::k::::-Spanner Problem. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 636-647, Springer, 2000. [doi]
@inproceedings{ElkinP00,
title = {Strong Inapproximability of the Basic ::::k::::-Spanner Problem},
author = {Michael Elkin and David Peleg},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1853/18530636.htm},
researchr = {https://researchr.org/publication/ElkinP00},
cites = {0},
citedby = {0},
pages = {636-647},
booktitle = {Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
editor = {Ugo Montanari and José D. P. Rolim and Emo Welzl},
volume = {1853},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67715-1},
}