No. Title Author Year
1 A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems Fielbaum, Andrés et al. 2020
2 Maintaining Perfect Matchings at Low Cost Matuschke, Jannik et al. 2019
3 A Local-Search Algorithm for Steiner Forest Groß, Martin et al. 2018
4 Symmetry Exploitation for Online Machine Covering with Bounded Migration Gálvez, Waldo et al. 2018
5 A QPTAS for the General Scheduling Problem with Identical Release Dates Antoniadis, Antonios et al. 2017
6 Closing the Gap for Makespan Scheduling via Sparsification Techniques Jansen, Klaus et al. 2016
7 Min-Sum Scheduling Under Precedence Constraints Schulz, Andreas S. et al. 2016
8 Scheduling periodic tasks in a hard real-time environment Eisenbrand, Friedrich et al. 2010
9 A Robust PTAS for the Parallel Machine Covering Problem Skutella, Martin et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI