Tighter bounds on a heuristic for a partition problem
type: Item
instance of: scholarly article
title: Tighter bounds on a heuristic for a partition problem
zbMATH Open document ID: 0875.68460
DOI: 10.1016/0020-0190(95)00099-X
author: O. Diekmann
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 983948
zbMATH Keywords: Discrete minimization
zbMATH Keywords: Partition
zbMATH Keywords: Storage allocation
zbMATH Keywords: NP-hard
zbMATH Keywords: Algorithms
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Worst-case bound
MaRDI profile type: Publication
cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
cites work: Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
cites work: Bounds on Multiprocessing Timing Anomalies
description: scientific article; zbMATH DE number 983948