How to Sort by Walking on a Tree

DOI10.1007/978-3-662-48350-3_54zbMath1369.68175OpenAlexW2295889644MaRDI QIDQ3452827

Daniel Graf

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_54

zbMATH Keywords

robot schedulingpermutation propertiesphysical sortingshortest sorting walkwarehouse reorganization

Mathematics Subject Classification ID

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 (3)

Sorting on graphs by adjacent swaps using permutation groups ⋮ How to sort by walking and swapping on paths and trees ⋮ Complexity of token swapping and its variants

Cites Work

• Unnamed Item
• Storage yard operations in container terminals: literature overview, trends, and research directions
• Robust Algorithms for Sorting Railway Cars
• Finding optimum branchings
• Hamilton Paths in Grid Graphs
• Optimum branchings
• A simple derivation of edmonds' algorithm for optimum branchings

This page was built for publication: How to Sort by Walking on a Tree