Models of Greedy Algorithms for Graph Problems
- 28 November 2007
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 54 (3) , 269-317
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- Toward a Model for Backtracking and Dynamic Programming2005
- How Well Can Primal-Dual and Local-Ratio Algorithms Perform?Lecture Notes in Computer Science, 2005
- Order-Preserving Transformations and Greedy-Like AlgorithmsLecture Notes in Computer Science, 2005
- The Power of Priority Algorithms for Facility Location and Set CoverAlgorithmica, 2004
- (Incremental) Priority AlgorithmsAlgorithmica, 2003
- Proving integrality gaps without knowing the linear program2003
- Improved non-approximability results for minimum vertex cover with density constraintsTheoretical Computer Science, 1999
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989