Kinetic facility location
From MaRDI portal
Publication:970606
DOI10.1007/s00453-008-9250-7zbMath1201.68041OpenAlexW1972925608MaRDI QIDQ970606
Joachim Gehweiler, Christiane Lammersen, Bastian Degener
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kinetic collision detection with fast flight plan changes
- Indexing moving points
- Discrete mobile centers
- Kinetic collision detection between two simple polygons.
- Cylindrical static and kinetic binary space partitions
- Lower bounds for kinetic planar subdivisions
- Smooth kinetic maintenance of clusters
- Clustering motion
- Deformable spanners and applications
- Approximating extent measures of points
- A Distributed Algorithm for the Facility Location Problem
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- The Kinetic Facility Location Problem
- Facility Location in Dynamic Geometric Data Streams
- A new greedy approach for facility location problems
- Algorithms for dynamic geometric problems over data streams
- Kinetic KD-trees and longest-side KD-trees
- Data Structures for Mobile Data
- Greedy Strikes Back: Improved Facility Location Algorithms
- The Online Median Problem
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- Facility location
- Improved Combinatorial Algorithms for Facility Location Problems
- Kinetic Collision Detection for Convex Fat Objects
- Automata, Languages and Programming
- Kinetic connectivity for unit disks
- Maintaining the extent of a moving point set
This page was built for publication: Kinetic facility location
