Fixed-parameter algorithms for unsplittable flow cover
From MaRDI portal
Publication:2701069
DOI10.1007/s00224-021-10048-7OpenAlexW3186633191MaRDI QIDQ2701069
Mathieu Mari, Andreas Wiese, Andrés Cristi
Publication date: 27 April 2023
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-021-10048-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the efficiency of polynomial time approximation schemes
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- A quasi-PTAS for unsplittable flow on line graphs
- On Capacitated Set Cover Problems
- Some Distribution-Free Aspects of Paging Algorithm Performance
- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
- On Parameterized Approximability
- Parameterized Approximation Problems
- On Column-Restricted and Priority Covering Integer Programs
- Caching Is Hard – Even in the Fault Model
- To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack
- Lossy kernelization
- A (1+epsilon)-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 Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
- New Approximation Schemes for Unsplittable Flow on a Path
- A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
- Better Approximations for General Caching and UFP-Cover Under Resource Augmentation
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: Fixed-parameter algorithms for unsplittable flow cover
