Packing cars into narrow roads: PTASs for limited supply highway
From MaRDI portal
Publication:5075798
DOI10.4230/LIPICS.ESA.2019.54MaRDI QIDQ5075798FDOQ5075798
Authors: Fabrizio Grandoni, Andreas Wiese 
Publication date: 11 May 2022
Recommendations
Cites Work
- On profit-maximizing envy-free pricing
- Single-minded unlimited supply pricing on sparse instances
- A sublogarithmic approximation for highway and tollbooth pricing
- On profit-maximizing pricing for the highway and tollbooth problems
- A unified approach to approximating resource allocation and scheduling
- Title not available (Why is that?)
- A constant factor approximation algorithm for unsplittable flow on paths
- Approximation algorithms for the unsplittable flow problem
- A path-decomposition theorem with applications to pricing and covering on trees
- A quasi-PTAS for unsplittable flow on line graphs
- Approximation algorithms and online mechanisms for item pricing
- Improved hardness results for profit maximization pricing problems with unlimited supply
- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
- Title not available (Why is that?)
- Multicommodity demand flow in a tree and packing integer programs
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- Constant integrality gap LP formulations of unsplittable flow on a path
- New approximation schemes for unsplittable flow on a path
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- Title not available (Why is that?)
- A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes
- To augment or not to augment: solving unsplittable flow on a path by creating slack
- Pricing on paths: a PTAS for the highway problem
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)
