View Document Preview and Link Document Date: 2012-09-05 00:22:46 Open Document File Size: 234,03 KB Share Result on Facebook
City Tel Aviv / New York / / Company Goodrich / / Country Jordan / United States / Israel / / / Facility Duke University / Tel Aviv University / Courant Institute of Mathematical Sciences / New York University / / IndustryTerm present near-linear-time approximation algorithms / by-product / faster algorithm / polynomial-time approximation algorithms / polynomial-time algorithms / sensor networks / near-linear algorithms / previous algorithm / database systems / approximation algorithm / shallow-cutting algorithm / greedy algorithm / near-linear hitting-set algorithms / exponential search / present algorithms / geometric applications / fractional solution / local-search / overall algorithm / mostly focused on developing polynomial-time approximation algorithms / / Organization Duke University / School of Computer Science / National Institute of Health / New York University / New York / National Science Foundation / Department of Computer Science / Tel Aviv University / US-Israel Binational Science Foundation / Israel Science Fund / MINERVA Center for Geometry / Courant Institute of Mathematical Sciences / Duke University / Durham / / Person Pankaj Agarwal / Esther Ezra / Pankaj K. Agarwal† Esther Ezra / Ray / Mustafa / / / Position King / discrete model / using ε-nets / / ProgrammingLanguage R / / ProvinceOrState North Carolina / New York / / Technology previous algorithm / faster algorithm / polynomial-time approximation algorithms / randomized algorithm / near-linear hitting-set algorithms / overall algorithm / approximation algorithm / hitting-set algorithms / polynomial-time algorithms / present near-linear-time approximation algorithms / time algorithm / hitting-set algorithm / greedy algorithm / shallow-cutting algorithm / near-linear algorithms / The algorithm / / 
Near-Linear Approximation Algorithms for Geometric Hitting Sets∗ Pankaj K. Agarwal† Esther Ezra‡