Approximation Algorithms for Extensible Bin Packing

No abstract is available for this paper.

• Publication year

  2001

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  2001-01-09

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10951-006-5594-5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• When does a dynamic programming formulation guarantee the existence of an FPTAS?

  1999cited by this paper
• Approximation schemes for scheduling on parallel machines

  1998influential reference
• A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins

  1998cited by this paper
• GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION: (Algorithms and Combinatorics 2)

  1990cited by this paper
• Geometric Algorithms and Combinatorial Optimization

  1988cited by this paper
• An Efficient Approximation Scheme for Variable-Sized Bin Packing

  1987cited by this paper
• Using dual approximation algorithms for scheduling problems: Theoretical and practical results

  1985cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• An efficient approximation scheme for the one-dimensional bin-packing problem

  1982cited by this paper
• The ellipsoid method and its consequences in combinatorial optimization

  1981cited by this paper
• Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979

  1980cited by this paper

• Green Bin Packing

  2025cites this paper
• Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem

  2025cites this paper
• Semi-Online Algorithms for the Hierarchical Extensible Bin-Packing Problem and Early Work Problem

  2024cites this paper
• Meta-Heuristic Algorithms for the Generalized Extensible Bin Packing Problem With Overload Cost

  2022cites this paper
• Online Bin Packing with Overload Cost

  2021cites this paper
• Stochastic Extensible Bin Packing

  2020cites this paper
• Approximation Schemes for the Generalized Extensible Bin Packing Problem

  2019cites this paper
• Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers

  2017cites this paper
• Optimal booking and scheduling in outpatient procedure centers

  2014cites this paper
• Parallelizing generalized one-dimensional bin packing problem using MapReduce

  2014cites this paper
• Fast Approximations for Online Scheduling of Outpatient Procedure Centers

  2014cites this paper
• Exploiting Fashion Features for Floor Storage Systems in the Shoe Industry

  2013cites this paper
• Dynamic Fractional Resource Scheduling versus Batch Scheduling

  2012cites this paper
• Structure of Polynomial-Time Approximation

  2012influential citation
• Dynamic Fractional Resource Scheduling vs. Batch Scheduling

  2011cites this paper
• A metric between probability distributions on finite sets of different cardinalities

  2011cites this paper
• A Novel Gray Image Representation Method Based on NAM Using Nonoverlapping Square Subpatterns

  2011cites this paper
• A Metric Between Probability Distributions on Finite Sets of Different Cardinalities and Applications to Order Reduction

  2011cites this paper
• Dynamic Fractional Resource Scheduling for cluster platforms

  2010cites this paper
• Dynamic fractional resource scheduling for HPC workloads

  2010cites this paper
• Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process

  2009cites this paper
• New generalized assignment problem with identified first-use bins

  2008cites this paper
• REPLICACI ´ ON AUTON ´ OMICA DE BASES DE DATOS

  2008cites this paper
• Two stages optimization problem: New variant of Bin Packing Problem for decision making

  2008cites this paper
• Improved Ant Colony Optimization for One-Dimensional Bin Packing Problem with Precedence Constraints

  2007cites this paper
• An improved typology of cutting and packing problems

  2007cites this paper
• Efficient Scheduling by Incorporating Bin Packing with Limited and Weighted Round Robin for Bluetooth

  2006cites this paper
• Maximizing data locality in distributed systems

  2006cites this paper
• Vector assignment schemes for asymmetric settings

  2006cites this paper
• Design and configuration of distributed job processing systems

  2006cites this paper
• Designing IP-based heterogeneous Radio Access Network

  2005cites this paper
• Search-based techniques applied to optimization of project planning for a massive maintenance project

  2005cites this paper
• Configuration of distributed message converter systems

  2004cites this paper
• 10 th International Software Metrics Symposium (METRICS 2004)

  2004cites this paper
• Optimal preemptive scheduling for general target functions

  2004influential citation
• A robust search-based approach to project management in the presence of abandonment, rework, error and uncertainty

  2004cites this paper
• On-line scheduling with extendable working time on a small number of machines

  2003cites this paper
• On-line extensible bin packing with unequal bin sizes

  2003cites this paper
• Vector assignment problems: a general framework

  2002cites this paper
• Graph Based Vector Assignment Schemes

  2002cites this paper
• International Journal of Engineering Business Management Special Issue on Innovations in Fashion Industry Exploiting Fashion Features for Floor Storage Systems in the Shoe Industry Regular Paper

  year unknowncites this paper