Approximate strip packing

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Proceedings of 37th Conference on Foundations of Computer Science

• Publication date

  1996-10-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SFCS.1996.548461
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An approximation scheme for strip packing of rectangles with bounded dimensions

  1994cited by this paper
• Fast approximation algorithms for fractional packing and covering problems

  1991cited by this paper
• Approximation Algorithms for Bin-Packing — An Updated Survey

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

  1982cited by this paper
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

  1981influential reference
• Bin packing can be solved within 1 + ε in linear time

  1981cited by this paper
• A 5/4 Algorithm for Two-Dimensional Packing

  1981cited by this paper
• A 2.5 Times Optimal Algorithm for Packing in Two Dimensions

  1980cited by this paper
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

  1980influential reference
• Orthogonal Packings in Two Dimensions

  1980cited by this paper

• Packing Multiple Types of Cores for Energy-Optimized Heterogeneous Hardware-Software Co-Design of Moldable Streaming Computations

  2023cites this paper
• Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing

  2021cites this paper
• Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items

  2021influential citation
• Scheduling Malleable Jobs Under Topological Constraints

  2020cites this paper
• Harmonic algorithms for packing d-dimensional cuboids into bins

  2020cites this paper
• 2-Dimensional packing algorithms on a variable-size rectangular interface

  2019cites this paper
• Interference-Aware Scheduling Using Geometric Constraints

  2018cites this paper
• iGreen: green scheduling for peak demand minimization

  2017cites this paper
• Not a tile out of place: Toward creating context-dependent user interfaces on smartglasses

  2016cites this paper
• On approximating strip packing with a better ratio than 3/2

  2016influential citation
• Online Square-into-Square Packing

  2014cites this paper
• 2D-Packing Images on a Large Scale: Packing a Billion Rectangles under 10 Minutes

  2014cites this paper
• Improved Lower Bound for Online Strip Packing

  2013cites this paper
• Smoothing the energy consumption: Peak demand reduction in smart grid

  2013cites this paper
• E-BLOW: E-beam lithography overlapping aware stencil planning for MCC system

  2013cites this paper
• Online Square Packing with Gravity

  2012cites this paper
• On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters

  2012cites this paper
• A Fast Approximation Scheme for the Multiple Knapsack Problem

  2012cites this paper
• Coordination Mechanisms for Selfish Parallel Jobs Scheduling - (Extended Abstract)

  2012cites this paper
• Tight approximation algorithms for scheduling with fixed jobs and nonavailability

  2012cites this paper
• Improved Lower Bound for Online Strip Packing - (Extended Abstract)

  2011cites this paper
• Solución del problema de empaquetamiento óptimo bidimensional en una sola placa, en placas y rollos infinitos con y sin rotación de piezas usando técnicas metaheurísticas de optimización

  2010cites this paper
• An improved heuristic and an exact algorithm for the 2D strip and bin packing problem

  2010cites this paper
• Algorithms for Packing Problems

  2010cites this paper
• Maintaining Virtual Areas on FPGAs using Strip Packing with Delays

  2010cites this paper
• Improved approximation algorithms for scheduling with fixed jobs

  2009cites this paper
• Maintaining Arrays of Contiguous Objects

  2009cites this paper
• Ordonnancement de tâches parallèles sur plates-formes hétérogènes partagées. (Scheduling Parallel Tasks on Shared Heterogeneous Platforms)

  2009cites this paper
• A note on online strip packing

  2009cites this paper
• Approximation algorithms for linear programs and geometrically constrained packing roblems

  2009influential citation
• Parameterized Approximation Scheme for the Multiple Knapsack Problem

  2009influential citation
• Online Square Packing

  2009cites this paper
• Co-scheduling of Disk Head Time in Cluster-Based Storage

  2009cites this paper
• An Exact Method for the 2D Guillotine Strip Packing Problem

  2009cites this paper
• Parameterized Approximation Scheme for the Multiple Knapsack Problem ∗

  2008cites this paper
• A comparison study of heuristics for solving the 2D guillotine strip and bin packing problems

  2008cites this paper
• On-line scheduling of parallel jobs in a list

  2007influential citation
• A 3/2-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks

  2007cites this paper
• A COMPARATIVE STUDY OF EXACT ALGORITHMS FOR THE TWO DIMENSIONAL STRIP PACKING PROBLEM

  2007cites this paper
• Faster and simpler approximation algorithms for mixed packing and covering problems

  2007cites this paper
• -APPROXIMATION ALGORITHM FOR SCHEDULING INDEPENDENT MONOTONIC MALLEABLE TASKS∗

  2007cites this paper
• Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem

  2006cites this paper
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

  2006cites this paper
• Experimental Results in Approximation of Max-Min Resource Sharing ?

  2006cites this paper
• An approximation algorithm for the general max-min resource sharing problem

  2006cites this paper
• Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications

  2006cites this paper
• Approximation Algorithm for the Mixed Fractional Packing and Covering Problem

  2006cites this paper
• On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes

  2006cites this paper
• Packing Weighted Rectangles into a Square

  2005cites this paper
• New heuristic and interactive approaches to 2D rectangular strip packing

  2005cites this paper
• On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems

  2005cites this paper
• The two-dimensional cutting stock problem revisited

  2005influential citation
• Modèles d'habillage de surface pour la synthèse d'images. (Texturing methods for Computer Graphics)

  2005cites this paper
• On Efficient Weighted Rectangle Packing with Large Resources

  2005influential citation
• Metal cutting with hybrid genetic algorithm

  2005cites this paper
• On Packing Squares with Resource Augmentation: Maximizing the Profit

  2005cites this paper
• Solving Packing Problem with Weaker Block Solvers

  2004cites this paper
• Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler

  2004cites this paper
• On Weighted Rectangle Packing with Large Resources

  2004cites this paper
• Strip-packing using hybrid genetic approach

  2004cites this paper
• Packing Problems with Orthogonal Rotations

  2004cites this paper
• Hybrid genetic algorithm for cutting and packing problems

  2004cites this paper
• Some results on resource constrained scheduling

  2004cites this paper
• Exhaustive approaches to 2D rectangular perfect packings

  2004cites this paper
• Approximation Algorithms for Mixed Fractional Packing and Covering Problems

  2004cites this paper
• New approximability and inapproximability results for 2-dimensional Bin Packing

  2004cites this paper
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches

  2003cites this paper
• A hybrid genetic approach for garment cutting in the clothing industry

  2003cites this paper
• On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

  2002cites this paper
• Polynomial time approximation schemes for general multiprocessor job shop scheduling

  2002cites this paper
• Approximation of Geometric Dispersion Problems

  2001cites this paper
• Online strip packing with modifiable boxes

  2001cites this paper
• Approximation Algorithms for Fractional Covering and Packing Problems, and Applications

  2001cites this paper
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

  2000cites this paper
• Ordonnancement efficace d'applications parallèles : les tâches malléables monotones. (Efficient Scheduling of Parallel Application : The Monotonic Malleable Tasks)

  2000cites this paper
• Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time

  2000cites this paper
• Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

  1999cites this paper
• Complexity and Approximation

  1999cites this paper
• Approximation of Geometric Dispersion Problems

  1998cites this paper
• On approximating rectangle tiling and packing

  1998cites this paper
• Scheduling Independent Multiprocessor Tasks

  1997cites this paper
• Shelf Algorithms for On-Line Strip Packing

  1997cites this paper
• Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation of Geometric Dispersion Problems

  1997cites this paper
• An approximation scheme for strip packing of rectangles with bounded dimensions

  1994cites this paper
• A compendium of NP optimization problems

  1994cites this paper
• Critical Resource Sharing for Cooperation in Complex Systems

  year unknowncites this paper