How to sort by walking and swapping on paths and trees
DOI10.1007/s00453-017-0282-8zbMath1372.68075OpenAlexW2583609020MaRDI QIDQ2408166
Publication date: 10 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0282-8
robot schedulingpermutation propertiesensemble motion planningphysical sortingrobot transportation problemshortest sorting walkwarehouse reorganization
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pancake flipping is hard
- INSERTION SORT is \(O(n \log n)\)
- The complexity of finding minimum-length generator sequences
- Bounds for sorting by prefix reversal
- Class Steiner trees and VLSI-design
- Routing a vehicle of capacity greater than one
- A survey of stack-sorting disciplines
- Swapping labeled tokens on graphs
- Polynomial-Time Algorithm for Sliding Tokens on Trees
- Nonpreemptive Ensemble Motion Planning on a Tree
- Electronic Data Sorting
- How to Sort by Walking on a Tree
- Shunting for Dummies: An Introductory Algorithmic Survey
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Preemptive Ensemble Motion Planning on a Tree
- A Note on the Complexity of a Simple Transportation Problem
- Finding optimum branchings
- Sorting by Placement and Shift
- Hamilton Paths in Grid Graphs
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Optimum branchings
- A simple derivation of edmonds' algorithm for optimum branchings
- Sorting Using Networks of Queues and Stacks
This page was built for publication: How to sort by walking and swapping on paths and trees
