Minimizing movement: fixed-parameter tractability

DOI10.1145/2650247MaRDI QIDQ4962172zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Dániel Marx, Mohammad T. Hajiaghayi

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL http://eprints.sztaki.hu/8206/

zbMATH Keywords

fixed-parameter tractabilitymovement problemspebblestreewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimizing Movement: Fixed-Parameter Tractability
• Minimizing movement
• 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

Cited in

(8)

• Optimizing movement in convex and non-convex path-networks to establish connectivity
• Minimizing Movement: Fixed-Parameter Tractability
• The parameterized complexity of motion planning for snake-like robots
• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
• Near-gathering of energy-constrained mobile agents
• The deep minimizing movement scheme
• The parameterized complexity of coordinated motion planning
• Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability

This page was built for publication: Minimizing movement: fixed-parameter tractability

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