A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
From MaRDI portal
Publication:3448853
DOI10.1007/978-3-662-47672-7_79zbMath1440.68336OpenAlexW2503761073MaRDI QIDQ3448853
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_79
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (4)
Flexible bandwidth assignment with application to optical networks ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ A constant factor approximation algorithm for the storage allocation problem ⋮ Flexible resource allocation to interval jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trimming weighted graphs of bounded treewidth
- Approximation algorithms for maximum independent set of pseudo-disks
- A constant factor approximation algorithm for the storage allocation problem
- Approximation algorithms for the unsplittable flow problem
- Resource allocation in bounded degree trees
- A polynomial time approximation algorithm for dynamic storage allocation
- Label placement by maximum independent set in rectangles
- On dependent randomized rounding algorithms
- Fast stabbing of boxes in high dimensions
- Trimming of graphs, with application to point labeling
- A quasi-PTAS for unsplittable flow on line graphs
- An improved approximation algorithm for resource allocation
- New Approximability Results for 2-Dimensional Packing Problems
- Multicommodity demand flow in a tree and packing integer programs
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
- The Linearity of First-Fit Coloring of Interval Graphs
- Approximation algorithms for dynamic storage allocation
- OPTVersusLOADin Dynamic Storage Allocation
- A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
- New Approximation Schemes for Unsplittable Flow on a Path
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- Mathematical Foundations of Computer Science 2005
- A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
