Michael Elkin, David Peleg. Approximating k-Spanner Problems for k>2. In Karen Aardal, Bert Gerards, editors, Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Volume 2081 of Lecture Notes in Computer Science, pages 90-104, Springer, 2001. [doi]
@inproceedings{ElkinP01:0,
title = {Approximating k-Spanner Problems for k>2},
author = {Michael Elkin and David Peleg},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2081/20810090.htm},
researchr = {https://researchr.org/publication/ElkinP01%3A0},
cites = {0},
citedby = {0},
pages = {90-104},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
editor = {Karen Aardal and Bert Gerards},
volume = {2081},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42225-0},
}