Sorting with complete networks of stacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5369 LNCS, Issue , 2008, Pages 895-906

  König, Felix G ^a   Lübbecke, Marco E ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL THEORY;

APPROXIMATION RATIOS; LOWER BOUNDS; NP-HARD; OPTIMIZ ATION PROBLEMS; RESOURCE AUGMENTATION; SORT ALGORITHM;

APPROXIMATION ALGORITHMS;

EID: 58549090370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_78     Document Type: Conference Paper

References (19)

1. Ageev, A.A.: Every circle graph of girth at least 5 is 3-colourable. Discrete Math. 195(1-3), 229-233 (1999)
2. Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Appl. Math. 103(1-3), 271-279 (2000)
3. Blasum, U., Bussieck, M., Hochstättler, W., Moll, C., Scheel, H., Winter, T.: Scheduling trams in the morning. Math. Methods Oper. Res. 49(1), 137-148 (1999)
4. Bóna, M.: A survey of stack-sorting disciplines. Electron. J. Comb. 9(2) (2002)
5. Černý, J.: Coloring circle graphs. Electr. Notes Discrete Math. 29, 457-461 (2007)
6. Cornelsen, S., Di Stefano, G.: Track assignment. J. Discrete Algorithms 5(2), 250-261 (2007)
7. Even, S., Itai, A.: Queues, stacks, and graphs. In: Proceedings of the International Symposium on the Theory of Machines and Computations, pp. 71-86. Academic Press, New York (1971)
8. Felsner, S., Pergel, M.: Sorting using networks of stacks and queues. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 417-429. Springer, Heidelberg (2008)
9. Gallo, G., Di Miele, F.: Dispatching buses in parking depots. Transp. Sci. 35(3), 322-330 (2001)
10. Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3(3), 261-273 (1973)
11. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Elsevier B.V., Amsterdam (2004)
12. Gupta, N., Nau, D.S.: On the complexity of blocks-world planning. Artif. Intell. 56(2-3), 223-254 (1992)
13. Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1-2), 72-96 (2005)
14. Kann, V., Khanna, S., Lagergren, J., Panconesi, A.: On the hardness of approximating max k-cut and its dual. Chic. J. Theor. Comput. Sci. (1997)
15. Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edn. Addison Wesley Longman, Amsterdam (1998)
16. König, F.G., Lübbecke, M.E., Möhring, R.H., Schäfer, G., Spenke, I.: Practical solutions to PSPACE-complete stacking. In: Proceedings of the 15th European Symposium on Algorithms. Lect. Notes Comput. Sci, vol. 4698, pp. 729-740. Springer, Heidelberg (2007)
17. Nilsson, N.J.: Principles of Artificial Intelligence. Morgan Kaufmann, San Francisco (1980)
18. Tarjan, R.: Sorting using networks of queues and stacks. J. ACM 19(2), 341-346 (1972)
19. Unger, W.: On the k-colouring of circle graphs. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 61-72. Springer, Heidelberg (1988)