Back to Results
First PageMeta Content
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


CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin
Add to Reading List

Document Date: 2014-08-05 11:21:00

Open Document

File Size: 140,20 KB

Share Result on Facebook

City

Halifax / New York / /

Company

Oxford University Press Inc. / /

Country

United States / Netherlands / Iran / /

/

Facility

Sharif University of Technology / Art gallery / University of Maryland / /

IndustryTerm

polynomial time algorithms / integral solutions / approximation algorithm / omnidirectional wireless modem / polynomial time algorithm / not-necessarily-optimal solution / polynomial time solution / cameras travel / 2approximation algorithm / integral solution / /

Organization

School of Computer Science / University of Maryland / Department of Computer Science / Institute for Research / Oxford University / Sharif University of Technology / Tehran / Department of Computer Engineering / /

Person

Masood Seddighin / Salma Sadat Mahdavi∗ Saeed / E. D. Demaine / V / D. T. Lee / Arthur K. Lin / Mohammad Ghodsi / P. Morin / V / /

Position

set VP / guard / This author / /

ProvinceOrState

Maryland / Nova Scotia / New York / /

PublishedMedium

IEEE Transactions on Information Theory / /

Technology

polynomial time algorithm / approximation algorithm / 2-approximation algorithm / 2approximation algorithm / 3 Approximation Algorithm / polynomial time algorithms / /

SocialTag