Publication

A Quasi-Polynomial Approximation For The Restricted Assignment Problem

Lars Rohwedder
2020
Journal Articles

Abstract

The RESTRICTED ASSIGNMENT problem is a prominent special case of SCHEDULING ON UNRELATED PARALLEL MACHINES. For the strongest known linear programming relaxation, the configuration LP, we improve the nonconstructive bound on its integrality gap from 1.9412 to 1.8334 and significantly simplify the proof. Then we give a constructive variant, yielding a 1.8334-approximation in quasi-polynomial time. This is the first quasi-polynomial algorithm for this problem improving on the long-standing approximation rate of 2.

Official source

https://infoscience.epfl.ch/entities/publication/5649ee23-fe5d-4708-94da-27af8360dc5a

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Quasi-Polynomial Approximation For The Restricted Assignment Problem

Chat with Graph Search

Measuring Linkability of Protected Biometric Templates Using Maximal Leakage

Disagreement and fragmentation in growing groups

A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem