Sorting with Complete Networks of Stacks
From MaRDI portal
Publication:3597888
DOI10.1007/978-3-540-92182-0_78zbMath1183.68234OpenAlexW1590662462MaRDI QIDQ3597888
Marco E. Lübbecke, Felix G. König
Publication date: 29 January 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15612
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Approximation algorithms (68W25)
Related Items (4)
Rerouting shortest paths in planar graphs ⋮ A mathematical formulation and complexity considerations for the blocks relocation problem ⋮ Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms ⋮ Generalised online colouring problems in overlap graphs
This page was built for publication: Sorting with Complete Networks of Stacks
