Priority algorithms for graph optimization problems

Lecture Notes in Computer Science

Volumn 3351, Issue , 2005, Pages 126-139

  Borodin, Allan ^a   Boyar, Joan ^b   Larsen, Kim S ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

GRAPH OPTIMIZATION; GRAPH THEORETIC SETTING; INPUT FORMULATION; PRIORITY ALGORITHMS;

ALGORITHMS;

EID: 23944460127     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31833-0_12     Document Type: Conference Paper

References (21)

1. S. Angelopoulos. Ordering-preserving transformations and greedy-like algorithms. In 2nd Workshop on Approximation and Online Algorithms, 2004. This volume.
2. S. Angelopoulos and A. Borodin. On the power of priority algorithms for facility location and set cover. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, volume 2462 of Lecture Notes in Computer Science, pages 26-39. Springer-Verlag, 2002.
3. Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs and non-approximability - towards tight results. SIAM Journal on Computing, 27:804-915, 1998.
4. Piotr Berman and Toshihiro Fujito. On approximation properties of the independent set problem for degree 3 graphs. In Fourth International Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 449-460. Springer-Verlag, 1995.
5. Ravi Boppana and Magnús M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. Bit, 32:180-196, 1992.
6. A. Borodin, M. Nielsen, and C. Rackoff. (Incremental) priority algorithms. Algorithmica, 37:295-326, 2003.
7. Allan Borodin, Joan Boyar, and Kim S. Larsen. Priority algorithms for graph optimization problems. Preprint PP-2004-10, Department of Mathematics and Computer Science, University of Southern Denmark, 2004.
8. Kenneth L. Clarkson. A modification of the greedy algorithm for vertex cover. Information Processing Letters, 16:23-25, 1983.
9. S. Davis and R. Impagliazzo. Models of greedy algorithms for graph problems. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.
10. Irit Dinur and Shmuel Safra. The importance of being biased. In Proceedings of the 34th Symposium on Theory of Computing, pages 33-42. ACM Press, 2002.
11. Jack Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1:127-136, 1971.
12. Urid Feige and Joe Kilian. Zero knowledge and the chromatic number. Journal of Computer and System Sciences, 57:187-199, 1998.
13. 1-ε. Acta Mathematica, 182:105-142, 1999.
14. Magnús M. Halldórsson. A still better performance guarantee for approximate graph coloring. Information Processing Letters, 45:19-23, 1993.
15. D. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
16. David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256-278, 1974.
17. Sanjeev Khanna, Nathan Linial, and Shmuel Safra. On the hardness of approximating the chromatic number. Combinatorica, 20(3):393-415, 2000.
18. D. Lehmann, L. O'Callaghan, and Y. Shoham. Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM, 49(5): 1-26, 2002.
19. C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
20. G. Szekeres and Herbert S. Wilf. An inequality for the chromatic number of graphs. Journal of Combinatorial Theory, 4:1-3, 1968.
21. Vijay V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.