Facility reallocation on the line

DOI10.1007/s00453-022-00993-1OpenAlexW3136352501MaRDI QIDQ2088586

Dominik Wojtczak, Bart de Keijzer

Publication date: 6 October 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.12894

zbMATH Keywords

online algorithmsfacility locationstrategy-proof mechanisms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (2)

Serving Online Requests with Mobile Servers ⋮ Minmax for facility location game with optional preference under minimum distance requirement

Cites Work

• Online facility location with facility movements
• Facility location games with optional preference
• Reallocating multiple facilities on the line
• Locating libraries on a street
• Minimizing movement in mobile facility location problems
• On the Complexity of Some Common Geometric Location Problems
• The Maximum Coverage Location Problem
• Dynamic Facility Location via Exponential Clocks
• Changing Bases: Multistage Optimization for Matroids and Matchings
• Facility Location in Evolving Metrics
• Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)
• Two-facility Location Games with Minimum Distance Requirement

This page was built for publication: Facility reallocation on the line