Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time

DOI10.1137/1.9781611975482.95zbMath1431.68154OpenAlexW4243028800MaRDI QIDQ5236279

Shi Li, Janardhan Kulkarni, Shashwat Garg

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.95

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm ⋮ An improved approximation algorithm for scheduling under arborescence precedence constraints

This page was built for publication: Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time