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]
No references recorded for this publication.
No citations of this publication recorded.