Two-Dimensional partitioning problems

DOI10.1016/0304-3975(95)00185-9zbMath0874.68148OpenAlexW2081883740MaRDI QIDQ671423

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

partitioningscheduling2-Dimensional Consecutive Sets problemstorage organization

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of finding uniform emulations on paths and ring networks
• One more polynomial complete consecutive retrieval problem
• More on the complexity of common superstring and supersequence problems
• 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

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