search result

Cover von Online Primal-Dual Algorithms with Configuration Linear Programs

Online Primal-Dual Algorithms with Configuration Linear Programs

Year: 2020
Media group: LIPIcs
Cover von An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints

An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints

Year: 2020
Media group: LIPIcs
Cover von Game Efficiency Through Linear Programming Duality

Game Efficiency Through Linear Programming Duality

Year: 2018
Media group: LIPIcs
Cover von A Greedy Algorithm for Subspace Approximation Problem

A Greedy Algorithm for Subspace Approximation Problem

Year: 2018
Media group: LIPIcs
Cover von Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines

Year: 2018
Media group: LIPIcs
Cover von The local–global conjecture for scheduling with non-linear cost
article : pp. 239-254
Search for this author
Year: 2017
Publisher: Berlin, Springer
Series: Journal of scheduling; 20. 2017, 3
Media group: ARTICLE
Cover von Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality

Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality

Year: 2016
Media group: LIPIcs
Cover von Front Matter, Table of Contents, Preface, Conference Organization

Front Matter, Table of Contents, Preface, Conference Organization

Year: 2025
Media group: LIPIcs
Cover von LIPIcs, Volume 327, STACS 2025, Complete Volume

LIPIcs, Volume 327, STACS 2025, Complete Volume

Year: 2025
Media group: LIPIcs
Cover von 42nd International Symposium on Theoretical Aspects of Computer Science
STACS 2025, March 4-7, 2025, Jena, Germany
Search for this author
Year: 2025
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 327
Media group: LIPIcs
OPEN V 11.1.0.0