Worst-case performance of Rayward–Smith's Steiner tree heuristic
Information Processing Letters
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Foundations of algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Approximation algorithms
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proving Integrality Gaps without Knowing the Linear Program
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Greedy Approximations of Independent Sets in Low Degree Graphs
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
On the Power of Priority Algorithms for Facility Location and Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Hierarchies for classes of priority algorithms for job scheduling
Theoretical Computer Science
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Randomized priority algorithms
Theoretical Computer Science
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Priority algorithms for graph optimization problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Order-preserving transformations and greedy-like algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Priority algorithms for the subset-sum problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Borodin, Nielsen, and Rackoff ([5]) gave a model of greedy-like algorithms for scheduling problems and [1] extended their work to facility location and set cover problems. We generalize their notion to include other optimization problems, and apply the generalized framework to graph problems. Our goal is to define an abstract model that captures the intrinsic power and limitations of greedy algorithms for various graph optimization problems. We prove bounds on the approximation ratio achievable by such algorithms for basic graph problems such as shortest path, vertex cover, and others. Shortest path is an example of a problem where no algorithm in the FIXED priority model can achieve any approximation ratio (even one dependent on the graph size), but for which the well-known Dijkstra's algorithm shows that an ADAPTIVE priority algorithm can be optimal. We also prove that the approximation ratio for vertex cover achievable by ADAPTIVE priority algorithms is exactly 2. Here, a new lower bound matches the known upper bounds ([8]).