Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Artur Czumaj' in GoogleThis author has not been identified. Look up 'Andrzej Lingas' in GoogleThis author has not been identified. Look up 'Hairong Zhao' in Google

runs on WebDSL