Two-Dimensional partitioning problems

DOI10.1016/0304-3975(95)00185-9MaRDI QIDQ671423zbMATH OpenOpenAlexFDO

Authors Martin Middendorf

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00185-9

zbMATH Keywords

schedulingpartitioning2-Dimensional Consecutive Sets problemstorage organization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 3958753
• On the complexity of some partition problems
• Explicit solution of partitioning problems over a 1-dimensional parameter space
• Optimal Partitioning of Sequences
• Optimal Set Partitioning

Cites work

• scientific article; zbMATH DE number 3957178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
• File organization: Consecutive storage of relevant records on drum-type storage
• More on the complexity of common superstring and supersequence problems
• One more polynomial complete consecutive retrieval problem
• The complexity of finding uniform emulations on paths and ring networks

Cited in

(4)

• On a 2-dimensional equipartition problem
• Finding specified sections of arrangements: 2D results
• A two-phase method for multidimensional number partitioning problem
• New two-line arrays representing partitions

This page was built for publication: Two-Dimensional partitioning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671423)