On min-max graph balancing with strict negative correlation constraints
From MaRDI portal
Cites work
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
- A Tale of Santa Claus, Hypergraphs and Matroids
- Combinatorial Algorithm for Restricted Max-Min Fair Allocation
- scientific article; zbMATH DE number 5764783 (Why is no real title available?)
- scientific article; zbMATH DE number 5764883 (Why is no real title available?)
- scientific article; zbMATH DE number 512917 (Why is no real title available?)
- Improved integrality gap in max-min allocation: or topology at the north pole
- Lift-and-round to improve weighted completion time on unrelated machines
- Makespan minimization on unrelated parallel machines with a few bags
- On (1,)-restricted assignment makespan minimization
- On allocating goods to maximize fairness
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- On the Configuration-LP for Scheduling on Unrelated Machines
- On the configuration-LP of the restricted assignment problem
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Restricted max-min allocation: approximation and integrality gap
- Restricted Max-Min Fair Allocation
- Santa Claus Meets Hypergraph Matchings
- Santa Claus schedules jobs on unrelated machines
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- The design of approximation algorithms
- The Santa Claus problem
This page was built for publication: On min-max graph balancing with strict negative correlation constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953165)
