Motion planning with pulley, rope, and baskets
From MaRDI portal
(Redirected from Publication:385498)
Recommendations
- Motion planning with pulley, rope, and baskets
- SOKOBAN and other motion planning problems
- On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems
- Computational complexity of motion planning of a robot through simple gadgets
- Lower Bounds for Geometrical and Physical Problems
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Bin packing with divisible item sizes
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Introduction to algorithms
- On the equal-subset-sum problem
- The polynomial-time hierarchy
- When the Greedy Solution Solves a Class of Knapsack Problems
Cited in
(11)- Computing equilibria for integer programming games
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles
- Reconfiguration graphs of shortest paths
- Vote trading and subset sums
- Subset sum problems with digraph constraints
- On the Stackelberg knapsack game
- On the motion planning of the ball with a trailer
- Motion planning with pulley, rope, and baskets
- The Stackelberg model in territorial planning
- Rerouting shortest paths in planar graphs
- Independent set reconfiguration in cographs and their generalizations
This page was built for publication: Motion planning with pulley, rope, and baskets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385498)
