David Peleg, Eilon Reshef. Deterministic Polylog Approximation for Minimum Communication Spanning Trees. In Kim Guldstrand Larsen, Sven Skyum, Glynn Winskel, editors, Automata, Languages and Programming, 25th International Colloquium, ICALP 98, Aalborg, Denmark, July 13-17, 1998, Proceedings. Volume 1443 of Lecture Notes in Computer Science, pages 670-681, Springer, 1998. [doi]
@inproceedings{PelegR98,
title = {Deterministic Polylog Approximation for Minimum Communication Spanning Trees},
author = {David Peleg and Eilon Reshef},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1443/14430670.htm},
researchr = {https://researchr.org/publication/PelegR98},
cites = {0},
citedby = {0},
pages = {670-681},
booktitle = {Automata, Languages and Programming, 25th International Colloquium, ICALP 98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
editor = {Kim Guldstrand Larsen and Sven Skyum and Glynn Winskel},
volume = {1443},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64781-3},
}