Artur Czumaj, Andrzej Lingas, Hairong Zhao. Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. In Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo, editors, Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Volume 2380 of Lecture Notes in Computer Science, pages 973-984, Springer, 2002. [doi]
@inproceedings{CzumajLZ02,
title = {Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem},
author = {Artur Czumaj and Andrzej Lingas and Hairong Zhao},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2380/23800973.htm},
tags = {design},
researchr = {https://researchr.org/publication/CzumajLZ02},
cites = {0},
citedby = {0},
pages = {973-984},
booktitle = {Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
editor = {Peter Widmayer and Francisco Triguero Ruiz and Rafael Morales Bueno and Matthew Hennessy and Stephan Eidenbenz and Ricardo Conejo},
volume = {2380},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43864-5},
}