Motion planning with pulley, rope, and baskets

DOI10.1007/s00224-013-9445-4zbMath1277.68094OpenAlexW2151847882MaRDI QIDQ385498

Gerhard J. Woeginger, Christian E. J. Eggermont

Publication date: 2 December 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3390/

zbMATH Keywords

computational complexitypolynomial hierarchyplanning and scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Subset sum problems with digraph constraints ⋮ Computing equilibria for integer programming games ⋮ Reconfiguration graphs of shortest paths ⋮ Rerouting shortest paths in planar graphs ⋮ Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles ⋮ Vote trading and subset sums ⋮ On the Stackelberg knapsack game ⋮ The Stackelberg model in territorial planning ⋮ Independent Set Reconfiguration in Cographs and their Generalizations

Cites Work

• Bin packing with divisible item sizes
• On the equal-subset-sum problem
• The polynomial-time hierarchy
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• When the Greedy Solution Solves a Class of Knapsack Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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