Priority algorithms for graph optimization problems
暂无分享,去创建一个
Allan Borodin | Joan Boyar | Kim S. Larsen | Nazanin Mirmohammadi | A. Borodin | J. Boyar | Nazanin Mirmohammadi
[1] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[2] David Avis,et al. A list heuristic for vertex cover , 2007, Oper. Res. Lett..
[3] Russell Impagliazzo,et al. Models of Greedy Algorithms for Graph Problems , 2004, SODA '04.
[4] Allan Borodin,et al. The Power of Priority Algorithms for Facility Location and Set Cover , 2004, Algorithmica.
[5] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 2000, Comb..
[6] Allan Borodin,et al. Priority algorithms for the subset-sum problem , 2007, J. Comb. Optim..
[7] Allan Borodin,et al. Priority Algorithms for Graph Optimization Problems , 2004, WAOA.
[8] Piotr Berman,et al. On the Approximation Properties of Independent Set Problem in Degree 3 Graphs , 1995, WADS.
[9] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[10] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..
[11] Allan Borodin,et al. On the Power of Priority Algorithms for Facility Location and Set Cover , 2002, APPROX.
[12] Allan Borodin,et al. Toward a Model for Backtracking and Dynamic Programming , 2005, Computational Complexity Conference.
[13] Piotr Berman,et al. On Approximation Properties of the Independent Set Problem for Low Degree Graphs , 1999, Theory of Computing Systems.
[14] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[15] Magnús M. Hallórsson. A still better performance guarantee for approximate graph coloring , 1993 .
[16] R. Boppana. Approximating Maximum Independent Sets by Excluding Subgraphs 1 , 1990 .
[17] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[18] Allan Borodin,et al. (Incremental) Priority Algorithms , 2002, SODA '02.
[19] Spyros Angelopoulos. Order-Preserving Transformations and Greedy-Like Algorithms , 2004, WAOA.
[20] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[21] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..
[22] Uriel Feige,et al. Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[23] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[24] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[25] Kenneth L. Clarkson,et al. A Modification of the Greedy Algorithm for Vertex Cover , 1983, Inf. Process. Lett..
[26] Magnús M. Halldórsson,et al. A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Information Processing Letters.
[27] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[28] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[29] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[30] Magnús M. Halldórsson,et al. Online independent sets , 2002, Theor. Comput. Sci..
[31] Sanjeev Arora. Proving Integrality Gaps without Knowing the Linear Program , 2003, FCT.
[32] G. Szekeres,et al. An inequality for the chromatic number of a graph , 1968 .
[33] Jonas Holmerin,et al. Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.
[34] Subhash Khot,et al. Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[35] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[36] Béla Bollobás,et al. Proving integrality gaps without knowing the linear program , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[37] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[38] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[39] Lillian Lee,et al. Fast context-free grammar parsing requires fast boolean matrix multiplication , 2001, JACM.
[40] Allan Borodin,et al. Priority algorithms for the subset-sum problem , 2008, J. Comb. Optim..
[41] Irit Dinur,et al. The importance of being biased , 2002, STOC '02.