Multi-dimensional dynamic facility location and fast computation at query points

DOI10.1016/J.IPL.2008.12.014zbMATH Open1191.68751OpenAlexW2054190241MaRDI QIDQ976128FDOQ976128

Authors: Shimon Abravaya, Daniel Berend 

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.014

Recommendations

• scientific article; zbMATH DE number 2185624
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
• An O\((n \log{}n)\) algorithm for a maxmin location problem
• ε-Approximations for Multidimensional Weighted Location Problems
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem

zbMATH Keywords

computational geometryfacility locationminimax criterion

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The Weighted Euclidean 1-Center Problem
• Title not available (Why is that?)
• Linear Programming in Linear Time When the Dimension Is Fixed
• Minimizing the sum of the \(k\) largest functions in linear time.
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

Cited In (1)

• Facility Location in Dynamic Geometric Data Streams

This page was built for publication: Multi-dimensional dynamic facility location and fast computation at query points

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