Compact location problems with budget and communication constraints

DOI10.1007/bfb0030872zbMath1527.90125OpenAlexW1502036890MaRDI QIDQ6064048

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

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030872

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) 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
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Network decomposition for the optimization of connection structures
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Worst-Case Analysis of Network Design Problem Heuristics
• Approximation Schemes for the Restricted Shortest Path Problem
• Bicriteria Network Design Problems
• Many birds with one stone

This page was built for publication: Compact location problems with budget and communication constraints