Priority Algorithms for Graph Optimization Problems
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 126-139
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Order-Preserving Transformations and Greedy-Like AlgorithmsLecture Notes in Computer Science, 2005
- (Incremental) Priority AlgorithmsAlgorithmica, 2003
- On the Power of Priority Algorithms for Facility Location and Set CoverLecture Notes in Computer Science, 2002
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- Zero Knowledge and the Chromatic NumberJournal of Computer and System Sciences, 1998
- Free Bits, PCPs, and Nonapproximability---Towards Tight ResultsSIAM Journal on Computing, 1998
- On approximation properties of the Independent set problem for degree 3 graphs1995
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- A modification of the greedy algorithm for vertex coverInformation Processing Letters, 1983
- Matroids and the greedy algorithmMathematical Programming, 1971