Back to Results
First PageMeta Content



Approximation and Exact Algorithms for Minimum-Width Annuli and Shells Pankaj K. Agarwaly Boris Aronovz
Add to Reading List

Document Date: 2011-12-02 14:26:53

Open Document

File Size: 298,45 KB

Share Result on Facebook

City

Tel Aviv / Brooklyn / /

Company

Let CO / Ebara / VF / ESPRIT / /

Country

United States / Israel / /

Currency

pence / /

/

Facility

Tel Aviv University / Courant Institute of Mathematical Sciences / Polytechnic University / New York University / Duke University / /

IndustryTerm

hierarchical algorithm / subquadratic algorithms / simpler and faster algorithms / approximation algorithm / above algorithm / recursive algorithm / exponential search / rst subcubic algorithm / computing / overall algorithm / simpler algorithm / rst algorithm / near-linear time algorithm / /

Organization

Polytechnic University / Center for Geometric Computing / National Science Foundation / Department of Computer and Information Science / G.I.F. / Center for Geometry / Duke University / Durham / New York University / New York / Department of Computer Science / U.S.-Israeli Binational Science Foundation / German-Israeli Foundation for Scienti / Tel Aviv University / School of Mathematical Sciences / Courant Institute of Mathematical Sciences / /

Person

Pankaj K. Agarwaly Boris Aronovz Sariel / Ai / /

/

Product

Skullcandy G.I. Headphone/Headset / /

ProgrammingLanguage

C / /

ProvinceOrState

New York / North Carolina / /

Technology

Subquadratic algorithms / above algorithm / randomized algorithm / overall algorithm / simpler and faster algorithms / 2-Approximation Algorithm / previous algorithms / time algorithm / Dobkin-Kirkpatrick algorithm / recursive algorithm / rst algorithm / Dobkin-Kirkpatrick hierarchical algorithm / considerably simpler algorithm / resulting algorithm / rst subcubic algorithm / approximation algorithm / near-linear time algorithm / 3.1 Algorithm / second algorithm / following algorithms / /