论文信息 - Two-Dimensional Partitioning Problems

Two-Dimensional Partitioning Problems

Abstract We study the complexity of a class of partitioning problems which arise in storage organization and scheduling. All our problems are variants of the 2- Dimensional Consecutive Sets problem. The 2-Dimensional Consecutive Sets problem is to find for a given set L of strings over an alphabet Σ a partition of Σ into a sequence of sets such that the characters of each string S in L occur in exactly ¦ S ¦ consecutive sets of the sequence. All our problems are investigated with respect to restrictions concerning the length of the strings in L as well as the size and the number of sets in the partition of the alphabet.

Martin Middendorf

[1] Witold Lipski. One More Polynomial Complete Consecutive Retrieval Problem , 1977, Inf. Process. Lett..

[2] Jeffrey Scott Vitter,et al. Optimal disk I/O with parallel block transfer , 1990, STOC '90.

[3] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .

[4] James B. Saxe,et al. Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time , 1980, SIAM J. Algebraic Discret. Methods.

[5] Martin Middendorf. More on the Complexity of Common Superstring and Supersequence Problems , 1994, Theor. Comput. Sci..

[6] Hans L. Bodlaender,et al. The Complexity of Finding Uniform Emulations on Paths and Ring Networks , 1990, Inf. Comput..

[7] Sakti P. Ghosh. File Organization: Consecutive Storage of Relevant Records on Drum-Type Storage , 1974, Inf. Control..