scientific article; zbMATH DE number 7525519
From MaRDI portal
Publication:5075832
DOI10.4230/LIPIcs.ESA.2019.82MaRDI QIDQ5075832
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/2106.05939
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- On the configuration-LP for scheduling on unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- An approximation algorithm for the generalized assignment problem
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- Estimating the makespan of the two-valued restricted assignment problem
- Graph balancing: a special case of scheduling unrelated parallel machines
- An optimal rounding gives a better approximation for scheduling unrelated machines
- On some special cases of the restricted assignment problem
- The Santa Claus problem
- The Design of Approximation Algorithms
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- On the Configuration-LP of the Restricted Assignment Problem
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
- Santa Claus Schedules Jobs on Unrelated Machines
- Compact LP Relaxations for Allocation Problems
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
This page was built for publication:
