Approximation algorithms for round-UFP and round-SAP
From MaRDI portal
Cites work
- A (2+)-approximation algorithm for the storage allocation problem
- A (5/3+)-approximation for unsplittable flow on a path: placing small tasks into boxes
- A 3-approximation algorithm for maximum independent set of rectangles
- A constant factor approximation algorithm for unsplittable flow on paths
- A logarithmic approximation for unsplittable flow on line graphs
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A PTAS for packing hypercubes into a knapsack
- A PTAS for unsplittable flow on a path
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- An improved algorithm for online coloring of intervals with bandwidth
- Approximating geometric knapsack via L-packings
- Approximating maximum independent set for rectangles in the plane
- Approximation algorithms for the unsplittable flow problem on paths and trees
- Approximation and Online Algorithms
- Approximation and online algorithms for multidimensional bin packing: a survey
- Approximation schemes for independent set and sparse subsets of polygons
- Bin packing can be solved within 1+epsilon in linear time
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Breaking the barrier of 2 for the storage allocation problem
- Coloring and Maximum Weight Independent Set of Rectangles
- Complexity of approximating bounded variants of optimization problems
- Computing and Combinatorics
- Hardness of approximation for orthogonal rectangle packing and covering problems
- scientific article; zbMATH DE number 1305512 (Why is no real title available?)
- scientific article; zbMATH DE number 1107733 (Why is no real title available?)
- scientific article; zbMATH DE number 2079419 (Why is no real title available?)
- scientific article; zbMATH DE number 7278054 (Why is no real title available?)
- Improved approximation algorithm for two-dimensional bin packing
- Improved pseudo-polynomial-time approximation for strip packing
- Multicommodity demand flow in a tree and packing integer programs
- New approximation schemes for unsplittable flow on a path
- On Guillotine Separability of Squares and Rectangles.
- On rectangle packing, maximizing benefits
- On weighted bipartite edge coloring
- Online capacitated interval coloring
- OPT versus LOAD in dynamic storage allocation
- Peak Demand Minimization via Sliced Strip Packing.
- Routing and path multicoloring
- The complexity of path coloring and call scheduling
- There is no asymptotic PTAS for two-dimensional vector packing
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items
- Tight approximation algorithms for two-dimensional guillotine strip packing
- To augment or not to augment: solving unsplittable flow on a path by creating slack
- Unsplittable flow on a path: the game!
This page was built for publication: Approximation algorithms for round-UFP and round-SAP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969610)
