Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14385
For citation please use:
Main Title: Sorting with Complete Networks of Stacks
Author(s): König, Felix G.
Lübbecke, Marco E.
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15612
http://dx.doi.org/10.14279/depositonce-14385
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Knuth introduced the problem of sorting with a sequence of stacks. Tarjan extended this idea to sorting with acyclic networks of stacks (and queues), where items to be sorted move from a source through the network to a sink while they may be stored temporarily at nodes (the stacks). Both characterized which permutations are sortable; but complexity of sorting was not an issue.
Subject(s): stack
sorting
hardness of approximation
PSPACE-complete
Issue Date: 2007
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2007, 36
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-036-2007.pdf
Format: Adobe PDF | Size: 123.6 kB
DownloadShow Preview
Thumbnail
Report-036-2007.ps
Format: Postscript | Size: 222.67 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.