On minimum k-modal partitions of permutations

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

Volumn 3887 LNCS, Issue , 2006, Pages 374-385

  Di Stefano, Gabriele ^a   Krause, Stefan ^b   Lübbecke, Marco E ^c   Zimmermann, Uwe T ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithm; Cocoloring; K modal sequence; LP rounding; Mixed integer program; Monotone sequence; NP hardness; Online algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER NETWORKS; GRAPH THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS;

APPROXIMATION ALGORITHM; LP ROUNDING; MIXED INTEGER PROGRAM; NP-HARDNESS; ONLINE ALGORITHM;

MODAL ANALYSIS;

EID: 33745603447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_36     Document Type: Conference Paper

References (13)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Inc., Englewood Cliffs, New Jersey 07632, 1993.
2. R. Bar-Yehuda and S. Fogel. Partitioning a sequence into few monotone subsequences. Acta Inform., 35(5):421-440, 1998.
3. U. Blasum, M.R. Bussieck, W. Hochstättler, C. Moll, H.-H. Scheel, and T. Winter. Scheduling trams in the morning. Math. Methods Oper. Res., 49(1): 137-148, 1999.
4. A. Brandstädt and D. Kratsch. On partitions of permutations into increasing and decreasing subsequences. Elektron. Informationsverarb. Kybernet., 22(5/6):263-273, 1986.
5. F.R.K. Chung. On unimodal subsequences. J. Combin. Theory Ser. A, 29:267-279, 1980.
6. G. Di Stefano and M.L. Koči. A graph theoretical approach to the shunting problem. Electr. Notes Theor. Comput. Sci., 92:16-33, 2004.
7. A. Fiat and G.J. Woeginger. Online Algorithms - The State of the Art, volume 1442 of Lecture Notes in Computer Science. Springer, 1998.
8. F.V. Fomin, D. Kratsch, and J.-C. Novelli. Approximating minimum cocolourings. Inform. Process. Lett., 84(5);285-290, 2002.
9. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin, 2003.
10. J.M. Steele. Long unimodal subsequences: A problem of F.R.K. Chung. Discrete Math., 33:223-225, 1981.
11. J.M. Steele. Variations on the monotone subsequence theme of Erdos and Szekeres. In D. Aldous, P. Diaconis, J. Spencer, and J.M. Steele, editors, Discrete Probability and Algorithms, pages 111-131. Springer-Verlag, New-York, 1995.
12. K. Wagner. Monotonic coverings of finite sets. Elektron. Informationsverarb. Kybernet., 20(12):633-639, 1984.
13. T. Winter and U.T. Zimmermann. Real-time dispatch of trams in storage yards. Ann. Oper. Res., 96:287-315, 2000.