Reoptimization of Weighted Graph and Covering Problems
暂无分享,去创建一个
[1] Ewald Speckenmeyer,et al. Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.
[2] Mária Bieliková,et al. SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings , 2008, SOFSEM.
[3] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..
[4] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[5] David S. Johnson. Approximation algorithms for combinatorial problems , 1973, STOC '73.
[6] R. V. Stee,et al. Packing Rectangles into 2 OPT Bins Using Rotations , 2008 .
[7] Juraj Hromkovic,et al. Reoptimization of Steiner Trees , 2008, SWAT.
[8] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[9] Vangelis Th. Paschos,et al. Reoptimization of minimum and maximum traveling salesman's tours , 2009, J. Discrete Algorithms.
[10] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.
[11] Guido Proietti,et al. Reusing Optimal TSP Solutions for Locally Modified Input Instances , 2006, IFIP TCS.
[12] Luca Bertazzi,et al. Reoptimizing the traveling salesman problem , 2003, Networks.
[13] Lars Arge,et al. Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings , 2006, SWAT.
[14] Vangelis Th. Paschos,et al. Simple and Fast Reoptimizations for the Steiner Tree Problem , 2009, Algorithmic Oper. Res..
[15] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[16] Juraj Hromkovic,et al. On the Hardness of Reoptimization , 2008, SOFSEM.
[17] Johan Håstad,et al. Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..
[18] Yoshiharu Kohayakawa,et al. Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile , 2006, IFIP TCS.
[19] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .