Automata, Languages and Programming
From MaRDI portal
Publication:5716841
DOI10.1007/11523468zbMath1084.90524OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716841
Avner Magen, David Cashman, Allan Borodin
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Models of greedy algorithms for graph problems ⋮ On the Structure of Optimal Greedy Computation (for Job Scheduling) ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Characterizing sets of jobs that admit optimal greedy-like algorithms ⋮ A stronger model of dynamic programming algorithms ⋮ Randomized priority algorithms
