Two-Dimensional partitioning problems
type: Item
instance of: scholarly article
title: Two-Dimensional partitioning problems
zbMATH Open document ID: 0874.68148
DOI: 10.1016/0304-3975(95)00185-9
author: Martin Middendorf
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 983291
zbMATH Keywords: partitioning
zbMATH Keywords: storage organization
zbMATH Keywords: scheduling
zbMATH Keywords: 2-Dimensional Consecutive Sets problem
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00185-9
OpenAlex ID: W2081883740
cites work: The complexity of finding uniform emulations on paths and ring networks
cites work: Q4198056
cites work: File organization: Consecutive storage of relevant records on drum-type storage
cites work: One more polynomial complete consecutive retrieval problem
cites work: More on the complexity of common superstring and supersequence problems
cites work: Q3726172
cites work: Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
cites work: Algorithms for parallel memory. II: Hierarchical multilevel memories
description: scientific article; zbMATH DE number 983291