A (2+)-approximation algorithm for the storage allocation problem
From MaRDI portal
A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
Recommendations
- A constant factor approximation algorithm for the storage allocation problem
- A (5/3+)-approximation for unsplittable flow on a path: placing small tasks into boxes
- A mazing \(2+\epsilon\) approximation for unsplittable flow on a path
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- A (1+)-approximation for unsplittable flow on a path in fixed-parameter running time
Cites work
- OPTVersusLOADin Dynamic Storage Allocation
- A constant factor approximation algorithm for the storage allocation problem
- A constant-factor approximation algorithm for unsplittable flow on paths
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- A polynomial time approximation algorithm for dynamic storage allocation
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- A quasi-PTAS for unsplittable flow on line graphs
- A structural lemma in 2-dimensional packing, and its implications on approximability
- A unified approach to approximating resource allocation and scheduling
- An improved approximation algorithm for \textsc{Resource Allocation}
- Approximation algorithms for dynamic storage allocation
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation algorithms for the unsplittable flow problem
- Fast stabbing of boxes in high dimensions
- scientific article; zbMATH DE number 1303579 (Why is no real title available?)
- scientific article; zbMATH DE number 1305512 (Why is no real title available?)
- scientific article; zbMATH DE number 7051239 (Why is no real title available?)
- scientific article; zbMATH DE number 1445390 (Why is no real title available?)
- Improved approximation algorithms for rectangle tiling and packing.
- Label placement by maximum independent set in rectangles
- Mathematical Foundations of Computer Science 2005
- Maximum independent set of rectangles
- Multicommodity demand flow in a tree and packing integer programs
- New Approximability Results for 2-Dimensional Packing Problems
- New approximation schemes for unsplittable flow on a path
- On dependent randomized rounding algorithms
- On rectangle packing, maximizing benefits
- Resource allocation in bounded degree trees
- The Linearity of First-Fit Coloring of Interval Graphs
- Trimming of graphs, with application to point labeling
- Trimming weighted graphs of bounded treewidth
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
Cited in
(11)- Three approximation algorithms for solving the generalized segregated storage problem.
- Flexible bandwidth assignment with application to optical networks
- Approximation bounds for the minimum k-storage problem
- Flexible resource allocation to interval jobs
- Approximations for generalized unsplittable flow on paths with application to power systems optimization
- A HEURISTIC APPROACH FOR SOLVING SERIALLY DISTRIBUTED STORAGE DEPOTS UNDER GENERAL-INTEGER POLICY
- A constant factor approximation algorithm for the storage allocation problem
- scientific article; zbMATH DE number 3273532 (Why is no real title available?)
- A PTAS for the horizontal rectangle stabbing problem
- Breaking the barrier of 2 for the storage allocation problem
- Approximation algorithms for round-UFP and round-SAP
This page was built for publication: A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448853)
