Fixed-parameter algorithms for unsplittable flow cover
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1305389 (Why is no real title available?)
- scientific article; zbMATH DE number 503190 (Why is no real title available?)
- scientific article; zbMATH DE number 1559590 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- scientific article; zbMATH DE number 7204483 (Why is no real title available?)
- 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 primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- A quasi-PTAS for unsplittable flow on line graphs
- A unified approach to approximating resource allocation and scheduling
- Better Approximations for General Caching and UFP-Cover Under Resource Augmentation
- Caching is hard -- even in the fault model
- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- Lossy kernelization
- New approximation schemes for unsplittable flow on a path
- On Parameterized Approximability
- On capacitated set cover problems
- On column-restricted and priority covering integer programs
- On the efficiency of polynomial time approximation schemes
- Parameterized Approximation Problems
- Some Distribution-Free Aspects of Paging Algorithm Performance
- To augment or not to augment: solving unsplittable flow on a path by creating slack
This page was built for publication: Fixed-parameter algorithms for unsplittable flow cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701069)
