Unsplittable flow on a short path
From MaRDI portal
Cites work
- A (1+)-approximation for unsplittable flow on a path in fixed-parameter running time
- A (5/3+)-approximation for unsplittable flow on a path: placing small tasks into boxes
- A constant-factor approximation algorithm for unsplittable flow on paths
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- A minimal algorithm for the multiple-choice knapsack problem
- A PTAS for unsplittable flow on a path
- A quasi-PTAS for unsplittable flow on line graphs
- A unified approach to approximating resource allocation and scheduling
- An AFPTAS for bin packing with partition matroid via a new method for LP rounding
- An APTAS for bin packing with clique-graph conflicts
- An EPTAS for budgeted matroid independent set
- An FPTAS for budgeted laminar matroid independent set
- An improved approximation algorithm for \textsc{Resource Allocation}
- Approximation algorithms for the unsplittable flow problem
- Approximation Schemes for Multi-Budgeted Independence Systems
- Caching is hard -- even in the fault model
- Caching is hard -- even in the fault model
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constant integrality gap LP formulations of unsplittable flow on a path
- Elements of Information Theory
- Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back
- scientific article; zbMATH DE number 2080220 (Why is no real title available?)
- scientific article; zbMATH DE number 7051239 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1445390 (Why is no real title available?)
- Improved algorithms for resource allocation under varying capacity
- Improved approximation algorithms for unsplittable flow on a path with time windows
- Lower bounds for matroid optimization problems with a linear constraint
- Multicommodity demand flow in a tree and packing integer programs
- New approximation schemes for unsplittable flow on a path
- On the approximability of an interval scheduling problem
- Personnel scheduling: a literature review
- Resource Allocation in Bounded Degree Trees
- Resource allocation with time intervals
- Survey, categorization, and comparison of recent tour scheduling literature
- The Multiple-Choice Knapsack Problem
- 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
- Unsplittable flow on a path: the game!
This page was built for publication: Unsplittable flow on a short path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255441)
