Kinetic facility location

DOI10.1007/S00453-008-9250-7MaRDI QIDQ970606zbMATH OpenOpenAlexFDO

Authors Bastian Degener, Joachim Gehweiler, Christiane Lammersen

Publication date 19 May 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9250-7

zbMATH Keywords

approximation algorithmfacility locationdeterministic algorithmkinetic data structure

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1303547 (Why is no real title available?)
• scientific article; zbMATH DE number 1947060 (Why is no real title available?)
• scientific article; zbMATH DE number 1947377 (Why is no real title available?)
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• A Distributed Algorithm for the Facility Location Problem
• A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
• A new greedy approach for facility location problems
• Algorithms for dynamic geometric problems over data streams
• Approximating extent measures of points.
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Automata, Languages and Programming
• Clustering motion
• Cylindrical static and kinetic binary space partitions
• Data Structures for Mobile Data
• Deformable spanners and applications
• Discrete mobile centers
• Facility Location in Dynamic Geometric Data Streams
• Facility location, distributed approximation
• Greedy Strikes Back: Improved Facility Location Algorithms
• Improved Combinatorial Algorithms for Facility Location Problems
• Indexing moving points
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• Kinetic Collision Detection for Convex Fat Objects
• Kinetic KD-trees and longest-side KD-trees
• Kinetic collision detection between two simple polygons.
• Kinetic collision detection with fast flight plan changes
• Kinetic connectivity for unit disks
• Lower bounds for kinetic planar subdivisions
• Maintaining the extent of a moving point set
• Simplified kinetic connectivity for rectangles and hypercubes
• Smooth kinetic maintenance of clusters
• The Kinetic Facility Location Problem
• The Online Median Problem

Cited in

(5)

• Reallocating multiple facilities on the line
• Kinetic Maintenance of Mobile k-Centres on Trees
• The Kinetic Facility Location Problem
• Minimizing co-location potential of moving entities
• Topological stability of kinetic \(k\)-centers

This page was built for publication: Kinetic facility location

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