Motion planning with pulley, rope, and baskets

DOI10.4230/LIPIcs.STACS.2012.374zbMath1245.68104OpenAlexW2289306211MaRDI QIDQ2904777

Gerhard J. Woeginger, Christian E. J. Eggermont

Publication date: 23 August 2012

Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2012.374

zbMATH Keywords

computational complexityplanning and scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

The complexity of rerouting shortest paths

Uses Software

• Knapsack

This page was built for publication: Motion planning with pulley, rope, and baskets