O(1)-Approximations for Maximum Movement Problems

DOI10.1007/978-3-642-22935-0_6zbMath1343.68306OpenAlexW2289228561MaRDI QIDQ3088082

Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam

Publication date: 17 August 2011

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (8)

Euclidean movement minimization ⋮ Exact and approximate algorithms for movement problems on (special classes of) graphs ⋮ Network movement games ⋮ Mobile facility location: combinatorial filtering via weighted occupancy ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs

Cites Work

• Minimizing movement in mobile facility location problems
• Minimizing Movement: Fixed-Parameter Tractability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: O(1)-Approximations for Maximum Movement Problems