Minimizing movement

MaRDI QIDQ2934604zbMATH OpenFDO

Authors Erik D. Demaine, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveisgharan, Morteza Zadimoghaddam, Mohammad T. Hajiaghayi

Publication date 18 December 2014

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Minimizing movement
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• O(1)-approximations for maximum movement problems
• Euclidean movement minimization

Cited in

(12)

• Polygon-constrained motion planning problems
• Mobile facility location: combinatorial filtering via weighted occupancy
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Minimizing movement
• Euclidean movement minimization
• O(1)-approximations for maximum movement problems
• Graphs, Maneuvers and Turnpikes
• Minimizing Movement: Fixed-Parameter Tractability
• Minimizing movement: fixed-parameter tractability
• Collective fast delivery by energy-efficient agents
• On Min-Max r-Gatherings
• On min-max \(r\)-gatherings

This page was built for publication: Minimizing movement

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