Packing cars into narrow roads: PTASs for limited supply highway
From MaRDI portal
Publication:5075798
Recommendations
Cites work
- scientific article; zbMATH DE number 7051239 (Why is no real title available?)
- scientific article; zbMATH DE number 2086936 (Why is no real title available?)
- scientific article; zbMATH DE number 1445390 (Why is no real title available?)
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
- A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes
- A constant factor approximation algorithm for unsplittable flow on paths
- A path-decomposition theorem with applications to pricing and covering on trees
- A quasi-PTAS for unsplittable flow on line graphs
- A sublogarithmic approximation for highway and tollbooth pricing
- A unified approach to approximating resource allocation and scheduling
- Approximation algorithms and online mechanisms for item pricing
- Approximation algorithms for the unsplittable flow problem
- Constant integrality gap LP formulations of unsplittable flow on a path
- Improved hardness results for profit maximization pricing problems with unlimited supply
- Multicommodity demand flow in a tree and packing integer programs
- New approximation schemes for unsplittable flow on a path
- On profit-maximizing envy-free pricing
- On profit-maximizing pricing for the highway and tollbooth problems
- Pricing on paths: a PTAS for the highway problem
- Single-minded unlimited supply pricing on sparse instances
- To augment or not to augment: solving unsplittable flow on a path by creating slack
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
This page was built for publication: Packing cars into narrow roads: PTASs for limited supply highway
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075798)
