External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity and Approximability of Certain Bicriteria Location Problems

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.

Authors

Sven Oliver Krumke

This author has not been identified. Look up 'Sven Oliver Krumke' in Google

Hartmut Noltemeier

This author has not been identified. Look up 'Hartmut Noltemeier' in Google

S. S. Ravi

This author has not been identified. Look up 'S. S. Ravi' in Google

Madhav V. Marathe

This author has not been identified. Look up 'Madhav V. Marathe' in Google
runs on