scientific article; zbMATH DE number 1947045
From MaRDI portal
Publication:4411275
zbMath1013.90120MaRDI QIDQ4411275
Spyros Angelopoulos, Allan Borodin
Publication date: 7 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620026.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Hierarchies for classes of priority algorithms for job scheduling ⋮ On the Structure of Optimal Greedy Computation (for Job Scheduling) ⋮ Characterizing sets of jobs that admit optimal greedy-like algorithms ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Priority algorithms for graph optimization problems ⋮ Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
This page was built for publication:
