The Mixed Center Location Problem

DOI10.1007/978-3-319-48749-6_25zbMath1483.90073OpenAlexW2545262085MaRDI QIDQ2958327

Yi Xu, Yin-Feng Xu, Ji-Gen Peng

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_25

zbMATH Keywords

Voronoi diagramcomputational geometryfacility location problem\(k\)-center problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• A faster algorithm for the two-center decision problem
• Clustering to minimize the maximum intercluster distance
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• The discrete 2-center problem
• A near-linear algorithm for the planar 2-center problem
• More planar two-center algorithms
• Voronoi Diagrams and Delaunay Triangulations
• On the Complexity of Some Common Geometric Location Problems
• Finding tailored partitions
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A Best Possible Heuristic for the k-Center Problem
• The Euclidean k-Supplier Problem