Bin packing can be solved within 1+epsilon in linear time
type: Item
instance of: scholarly article
title: Bin packing can be solved within 1+epsilon in linear time
zbMATH Open document ID: 0485.68057
DOI: 10.1007/BF02579456
published in: Combinatorica
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 3763308
Wikidata QID: Q56212224
author: W. Fernandez de la Vega
author: George S. Lueker
MaRDI profile type: Publication
cites work: Time bounds for selection
cites work: Resource constrained scheduling as generalized bin packing
cites work: Q4198056
cites work: Fast algorithms for bin packing
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Q5585020
cites work: Finding the median
cites work: New Algorithms for Bin Packing
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Combinatorial Problems: Reductibility and Approximation
full work available at URL: https://doi.org/10.1007/bf02579456
OpenAlex ID: W2145028977
description: scientific article; zbMATH DE number 3763308