Improved algorithms for placing undesirable facilities

DOI10.1016/S0305-0548(01)00063-6zbMath1259.90060OpenAlexW1988013311MaRDI QIDQ1941958

Michael Segal, Matthew J. Katz, Klara Kedem

Publication date: 25 March 2013

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00063-6

zbMATH Keywords

facility locationcomputational geometrymaxminminsum

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Related Items (13)

Covering many or few points with unit disks ⋮ Packing two disks into a polygonal environment. ⋮ Solving a maximin location problem on the plane with given accuracy ⋮ Dispersing facilities on planar segment and circle amidst repulsion ⋮ Covering point sets with two disjoint disks or squares ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ Dispersing obnoxious facilities on a graph ⋮ Maximizing the number of obnoxious facilities to locate within a bounded region ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ Computing obnoxious 1-corner polygonal chains ⋮ Locating two obnoxious facilities using the weighted maximin criterion ⋮ Fast approximations for sums of distances, clustering and the Fermat-Weber problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Fractional cascading. I: A data structuring technique
• Fractional cascading. II: Applications
• On some geometric selection and optimization problems via sorted matrices
• OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
• Generalized Selection and Ranking: Sorted Matrices
• The single facility location problem with minimum distance constraints
• The rectilinear distance minisum problem with minimum distance constraints:

This page was built for publication: Improved algorithms for placing undesirable facilities