License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2019.3
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11415/
Mihalák, Matús ;
Pont, Marc
On Sorting with a Network of Two Stacks
Abstract
Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by pushing and popping the numbers to and from a given set of stacks. Multiple concrete decision or optimization questions are formed by restricting the access to the stacks. The motivation comes, e.g., from shunting train wagons in shunting yards, shunting trams in depots, or in stacking cargo containers on cargo ships or storage yards in transshipment terminals.
We consider the problem of sorting a permutation of n integers 1,2,...,n using k >= 2 stacks. In this problem, elements from the input sequence are pushed one-by-one (in the order of the elements in the sequence) to one of the k stacks. At any time, an element from a stack can be popped and pushed to another stack; such an operation is called a shuffle. Also, at any time, an element can be popped from a stack and placed to the output sequence. We can only place the elements to the output in the increasing order of their value such that at the end the output is the ordered sequence of the elements. The problem asks to minimize the number of shuffles in the process.
It is known that for k >= 4, the problem is NP-hard, and that there is no approximation algorithm unless P=NP. For k >= 3, it is known that at most O(n log n) shuffles are needed for any input sequence. For the case when k=2, there exist input sequences that require Omega(n^{2-epsilon}) shuffles, for any epsilon>0. Nothing substantially more is known for the case of k=2. In this paper, we study the following variant of the problem with k=2 stacks: no shuffle and no placement to the output sequence can happen before every element is in one of the two stacks. We show that our problem can be seen as the MinUnCut problem by providing a polynomial-time reduction, and thus we show that there exists a randomized O(sqrt{log n})-approximation algorithm and a deterministic O(log n)-approximation algorithm for our problem.
BibTeX - Entry
@InProceedings{mihalk_et_al:OASIcs:2019:11415,
author = {Mat{\'u}s Mihal{\'a}k and Marc Pont},
title = {{On Sorting with a Network of Two Stacks}},
booktitle = {19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)},
pages = {3:1--3:12},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-128-3},
ISSN = {2190-6807},
year = {2019},
volume = {75},
editor = {Valentina Cacchiani and Alberto Marchetti-Spaccamela},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11415},
doi = {10.4230/OASIcs.ATMOS.2019.3},
annote = {Keywords: Sorting, Stacks, Optimization, Algorithms, Reduction, MinUnCut}
}
|
Keywords: |
|
Sorting, Stacks, Optimization, Algorithms, Reduction, MinUnCut |
|
Collection: |
|
19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
15.11.2019 |
