On minimum k-modal partitions of permutations

Journal of Discrete Algorithms

Volumn 6, Issue 3, 2008, Pages 381-392

  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; Coloring; k modal sequence; LP rounding; Mixed integer program; Monotone sequence; NP hardness; Online algorithm

Indexed keywords

CONTROL THEORY; INTEGER PROGRAMMING; MILITARY DATA PROCESSING; NUCLEAR PROPULSION; PARTITIONS (BUILDING); POLYNOMIAL APPROXIMATION; PROGRAM INTERPRETERS;

(ALGORITHMIC) COMPLEXITY; BIN-PACKING; COCOLORING; COMPETITIVE RATIOS; ELSEVIER (CO); LOWER BOUNDS; LP ROUNDING; MIXED INTEGER PROGRAMS; NETWORK FLOWS; NP-HARD; ON LINE ALGORITHMS; OPTIMAL PARTITIONING; PERMUTATION (PERM); PERMUTATION GRAPHS; UNIMODAL;

MATHEMATICAL TRANSFORMATIONS;

EID: 47549091945     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2008.01.002     Document Type: Article

References (19)

1. Bar-Yehuda R., and Fogel S. Partitioning a sequence into few monotone subsequences. Acta Inform. 35 5 (1998) 421-440
2. Blasum U., Bussieck M.R., Hochstättler W., Moll C., Scheel H.-H., and Winter T. Scheduling trams in the morning. Math. Methods Oper. Res. 49 1 (1999) 137-148
3. Bóna M. A survey of stack-sorting disciplines. Electron. J. Combin. 9 (2002/2003) Article A1
4. Brandstädt A., and Kratsch D. On partitions of permutations into increasing and decreasing subsequences. Elektron. Informationsverarb. Kybernet. 22 5/6 (1986) 263-273
5. Chung F.R.K. On unimodal subsequences. J. Combin. Theory Ser. A 29 (1980) 267-279
6. M. Demange, T. Ekim, D. De Werra, A tutorial on the use of graph coloring models for some problems in robotics, Technical report, EPFL, Lausanne, Switzerland, 2007. European J. Oper. Res., in press
7. M. Demange, B. Leroy-Beaulieu, Online coloring of comparability graphs: Some results, ORWP 07/01, Institut de Mathématiques, EPFL Lausanne, 2007
8. Di Stefano G., and Koči M.L. A graph theoretical approach to the shunting problem. Electr. Notes Theor. Comput. Sci. 92 (2004) 16-33
9. Fiat A., and Woeginger G.J. Online Algorithms-The State of the Art. Lecture Notes in Computer Science vol. 1442 (1998), Springer, Berlin
10. Fomin F.V., Kratsch D., and Novelli J.-C. Approximating minimum cocolourings. Inform. Process. Lett. 84 5 (2002) 285-290
11. Geoffrion A.M. Lagrangean relaxation for integer programming. Math. Programming Stud. 2 (1974) 82-114
12. Knuth D.E. The Art of Computer Programming, vol. 1: Fundamental Algorithms. third ed. (1997), Addison-Wesley
13. Lübbecke M.E., and Desrosiers J. Selected topics in column generation. Oper. Res. 53 6 (2005) 1007-1023
14. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency (2003), Springer, Berlin
15. Steele J.M. Long unimodal subsequences: A problem of F.R.K. Chung. Discrete Math. 33 (1981) 223-225
16. Steele J.M. Variations on the monotone subsequence theme of Erdo{combining double acute accent}s and Szekeres. In: Aldous D., Diaconis P., Spencer J., and Steele J.M. (Eds). Discrete Probability and Algorithms (1995), Springer, New York 111-131
17. Di Stefano G., Krause S., Lübbecke M.E., and Zimmermann U.T. On minimum k-modal partitions of permutations. In: Correa J.R., Hevia A., and Kiwi M. (Eds). Latin American Theoretical Informatics (LATIN 2006). Lecture Notes in Computer Science vol. 3887 (2006), Springer, Berlin 374-385
18. Wagner K. Monotonic coverings of finite sets. Elektron. Informationsverarb. Kybernet. 20 (1984) 633-639
19. Winter T., and Zimmermann U.T. Real-time dispatch of trams in storage yards. Ann. Oper. Res. 96 (2000) 287-315