Artur Czumaj, Andrzej Lingas
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
ICALP, 1998.
@inproceedings{ICALP-1998-CzumajL,
author = "Artur Czumaj and Andrzej Lingas",
booktitle = "{Proceedings of the 25th International Colloquium on Automata, Languages and Programming}",
doi = "10.1007/BFb0055093",
isbn = "3-540-64781-3",
pages = "682--694",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity}",
volume = 1443,
year = 1998,
}