![Complexity classes / Polygons / Structural complexity theory / Mathematical optimization / Art gallery problem / Approximation algorithm / Reduction / NP-complete / Optimization problem / Theoretical computer science / Computational complexity theory / Applied mathematics Complexity classes / Polygons / Structural complexity theory / Mathematical optimization / Art gallery problem / Approximation algorithm / Reduction / NP-complete / Optimization problem / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/7bb6854efe2badd91936f1580af6c2f4.jpg) Date: 2014-08-05 11:21:00Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics | | CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed SeddighinAdd to Reading ListSource URL: www.cccg.caDownload Document from Source Website File Size: 140,20 KBShare Document on Facebook
|