Publication

On the Approximability of Single-Machine Scheduling with Precedence Constraints

Ola Nils Anders Svensson
2011
Journal Articles

Abstract

We consider the single-machine scheduling problem to minimize the weighted sum of completion times under precedence constraints. In a series of recent papers, it was established that this scheduling problem is a special case of minimum weighted vertex cover.

Official source

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.

On the Approximability of Single-Machine Scheduling with Precedence Constraints

Chat with Graph Search

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

New Graph Algorithms via Polyhedral Techniques

The Sketching Complexity of Graph and Hypergraph Counting