Parallel approximation algorithms for bin packing
type: Item
instance of: scholarly article
title: Parallel approximation algorithms for bin packing
zbMATH Open document ID: 0677.90054
DOI: 10.1016/0890-5401(89)90003-5
author: Richard J. Anderson
author: Ernst W. Mayr
author: Manfred K. Warmuth
published in: Information and Computation
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4110464
zbMATH Keywords: parallel complexity of polynomial heuristics
zbMATH Keywords: bin packing
zbMATH Keywords: polynomial approximation algorithms
MaRDI profile type: Publication
full work available at URL: 0890-5401(89)90003-5
OpenAlex ID: W1988727224
cites work: A new proof for the first-fit decreasing bin-packing algorithm
cites work: Optimal parallel generation of a computation tree form
cites work: Linear programming is log-space hard for P
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Parallelism in random access machines
cites work: The maximum flow problem is log space complete for P
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Parallel Prefix Computation
cites work: Parallel Processing with the Perfect Shuffle
description: scientific article; zbMATH DE number 4110464