EFFICIENT APPROXIMATION SCHEME FOR THE ONE-DIMENSIONAL BIN-PACKING PROBLEM.

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1982, Pages 312-320

  Karmarkar, Narendra ^a   Karp, Richard M ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PERFORMANCE BOUNDS; ELIMINATION OF SMALL PIECES; FRACTIONAL BIN PACKING; LINEAR PROGRAMMING RELAXATION SUBROUTINE; ONE-DIMENSIONAL BIN-PACKING PROBLEM; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0020252446     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1982.61     Document Type: Conference Paper

References (0)