A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
From MaRDI portal
Publication:6487362
DOI10.1007/978-3-031-12597-3_9zbMATH Open1512.68038MaRDI QIDQ6487362FDOQ6487362
Authors: Eric Angel, Sébastien Morais, Damien Regnault 
Publication date: 9 December 2022
Recommendations
- FPT approximation algorithm for scheduling with memory constraints
- Structural parameters for scheduling with assignment restrictions
- Approximation algorithms for time constrained scheduling
- Structural parameters for scheduling with assignment restrictions
- Scheduling tree dags on parallel architectures
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Approximation algorithms for scheduling unrelated parallel machines
- Treewidth. Computations and approximations
- FPT approximation algorithm for scheduling with memory constraints
- Graph minors. I. Excluding a forest
- A 3/2-approximation algorithm for \(k_i\)-partitioning
- Approximating Scheduling Machines with Capacity Constraints
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- A comment on scheduling two parallel machines with capacity constraints
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs
Cited In (1)
This page was built for publication: A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487362)
