Complexity and approximability of certain bicriteria location problems

DOI10.1007/3-540-60618-1_67OpenAlexW1577003987MaRDI QIDQ6122213

Sven O. Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc626386/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• Clustering to minimize the maximum intercluster distance
• Analytical models for locating undesirable facilities
• Improved non-approximability results
• Finding k points with minimum diameter and related problems
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Bicriteria Network Design Problems
• Heuristic and Special Case Algorithms for Dispersion Problems
• Many birds with one stone

This page was built for publication: Complexity and approximability of certain bicriteria location problems