Inapproximability Results for Guarding Polygons and Terrains
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[2] Luca Trevisan,et al. On Approximation Scheme Preserving Reducibility and Its Applications , 2000, Theory Comput. Syst..
[3] Luca Trevisan,et al. On Approximation Scheme Preserving Reducability and Its Applications , 1994, FSTTCS.
[4] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[5] Alok Aggarwal,et al. Computational Complexity of Restricted Polygon Decompositions , 1988 .
[6] 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.
[7] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[8] Prosenjit Bose,et al. Guarding Polyhedral Terrains , 1997, Comput. Geom..
[9] Stephan Eidenbenz. Inapproximability Results for Guarding Polygons without Holes , 1998, ISAAC.
[10] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.
[11] Stephan Eidenbenz,et al. Inapproximability of some art gallery problems , 1998, CCCG.
[12] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[13] Joseph O'Rourke,et al. Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.
[14] Carsten Lund,et al. Hardness of approximations , 1996 .
[15] Binhai Zhu,et al. Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time , 1997, Comput. Geom..
[16] Stephan Eidenbenz,et al. Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result , 1998, ESA.
[17] Pierluigi Crescenzi,et al. Introduction to the theory of complexity , 1994, Prentice Hall international series in computer science.
[18] Joseph C. Culberson,et al. Covering polygons is hard , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[19] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[20] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[21] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[22] T. Shermer. Recent Results in Art Galleries , 1992 .
[23] Marc J. van Kreveld,et al. Digital Elevation Models and TIN Algorithms , 1996, Algorithmic Foundations of Geographic Information Systems.
[24] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.