scientific article; zbMATH DE number 7561567

DOI10.4230/LIPIcs.ICALP.2019.74MaRDI QIDQ5091233

Lars Rohwedder, Klaus Jansen

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1811.00955

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graphschedulingapproximation algorithmlocal searchintegrality gap

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Structural parameters for scheduling with assignment restrictions

Cites Work

• On the configuration-LP for scheduling on unrelated machines
• Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
• Approximation algorithms for scheduling unrelated parallel machines
• A 3/2-approximation algorithm for the graph balancing problem with two weights
• A quasi-polynomial approximation for the restricted assignment problem
• Graph balancing: a special case of scheduling unrelated parallel machines
• On some special cases of the restricted assignment problem
• The Santa Claus problem
• Santa claus meets hypergraph matchings
• 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
• Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• On Allocating Goods to Maximize Fairness
• Compact LP Relaxations for Allocation Problems
• Estimating The Makespan of The Two-Valued Restricted Assignment Problem

This page was built for publication: