The Kinetic Facility Location Problem

DOI10.1007/978-3-540-69903-3_34MaRDI QIDQ3512474zbMATH OpenOpenAlexFDO

Authors Bastian Degener, Joachim Gehweiler, Christiane Lammersen

Publication date 15 July 2008

Published in Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69903-3_34

zbMATH Keywords

approximationfacility locationkinetic data structure

Mathematics Subject Classification ID

Data structures (68P05) Discrete location and assignment (90B80)

Recommendations

• Kinetic facility location
• Kinetic Maintenance of Mobile k-Centres on Trees
• Kinetic maintenance of mobile \(k\)-centres on trees
• Facility Location in Dynamic Geometric Data Streams
• A clustering-based approach to kinetic closest pair

Cited in

(4)

• Kinetic facility location
• Approximation algorithm for the kinetic robust \(k\)-center problem
• Kinetic Maintenance of Mobile k-Centres on Trees
• Minimizing co-location potential of moving entities

This page was built for publication: The Kinetic Facility Location Problem

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