Compact location problems with budget and communication constraints

DOI10.1007/BFB0030872MaRDI QIDQ6064048zbMATH OpenOpenAlexFDO

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

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

Approximation algorithms (68W25) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Compact location problems
• scientific article; zbMATH DE number 1076395
• Complexity and approximability of certain bicriteria location problems
• Service-constrained network design problems
• Approximation algorithms for minimum tree partition

Cites work

• A simple heuristic for the p-centre problem
• Analytical models for locating undesirable facilities
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Clustering to minimize the maximum intercluster distance
• Finding k points with minimum diameter and related problems
• scientific article; zbMATH DE number 437549 (Why is no real title available?)
• scientific article; zbMATH DE number 437570 (Why is no real title available?)
• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 177560 (Why is no real title available?)
• scientific article; zbMATH DE number 177561 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved non-approximability results
• Many birds with one stone
• 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

Cited in

(1)

• Complexity and approximability of certain bicriteria location problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064048)