Single facility collection depots location problem in the plane

DOI10.1016/j.comgeo.2008.04.004zbMath1169.65014OpenAlexW2019503641MaRDI QIDQ1025297

Sandip Das, Binay K. Bhattacharya, Robert Benkoczi, Jeff Sember

Publication date: 18 June 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.04.004

zbMATH Keywords

Voronoi diagramfacility locationapproximation algorithmsminmaxcoresetsminsum

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How bad can the centroid be?
• Algebraic optimization: The Fermat-Weber location problem
• A sweepline algorithm for Voronoi diagrams
• The algebraic degree of geometric optimization problems
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• One-way and round-trip center location problems
• Planar weber location problems with line barriers
• Approximating extent measures of points
• On coresets for k-means and k-median clustering
• A PTAS for k-means clustering based on weak coresets
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Computational Geometry in C
• The collection depots location problem on networks
• Minisum collection depots location problem with multiple facilities on a network
• Collection depots facility location problems in trees
• Smaller coresets for k-median and k-means clustering
• On the collection depots location problem