scientific article; zbMATH DE number 7525491
From MaRDI portal
Publication:5075798
DOI10.4230/LIPIcs.ESA.2019.54MaRDI QIDQ5075798
Fabrizio Grandoni, Andreas Wiese
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the unsplittable flow problem
- Pricing on Paths: A PTAS for the Highway Problem
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
- A quasi-PTAS for unsplittable flow on line graphs
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
- Multicommodity demand flow in a tree and packing integer programs
- Single-minded unlimited supply pricing on sparse instances
- A Sublogarithmic Approximation for Highway and Tollbooth Pricing
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
- To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack
- Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
- A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
- New Approximation Schemes for Unsplittable Flow on a Path
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
- 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:
