Approximation and Online Algorithms
From MaRDI portal
Publication:5896920
DOI10.1007/b95598zbMath1173.68856MaRDI QIDQ5896920
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
Related Items
Hierarchies for classes of priority algorithms for job scheduling, Models of greedy algorithms for graph problems, Characterizing sets of jobs that admit optimal greedy-like algorithms, Randomized priority algorithms, On the Structure of Optimal Greedy Computation (for Job Scheduling)