Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe. Complexity and Approximability of Certain Bicriteria Location Problems. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings. Volume 1017 of Lecture Notes in Computer Science, pages 73-87, Springer, 1995.
@inproceedings{KrumkeNRM95,
title = {Complexity and Approximability of Certain Bicriteria Location Problems},
author = {Sven Oliver Krumke and Hartmut Noltemeier and S. S. Ravi and Madhav V. Marathe},
year = {1995},
researchr = {https://researchr.org/publication/KrumkeNRM95},
cites = {0},
citedby = {0},
pages = {73-87},
booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings},
editor = {Manfred Nagl},
volume = {1017},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60618-1},
}