Back to Results
First PageMeta Content
Analysis of algorithms / Computational geometry / NP-complete problems / Ε-net / Time complexity / Set cover problem / Theoretical computer science / Applied mathematics / Computational complexity theory


Improved Bound for the Union of Fat Triangles∗ Esther Ezra† Boris Aronov‡ Abstract
Add to Reading List

Document Date: 2010-10-14 21:45:02

Open Document

File Size: 174,92 KB

Share Result on Facebook

City

Davenport / Brooklyn / Tel Aviv / New York / /

Company

Cambridge University Press / ABC / /

Country

Jordan / United States / Israel / /

Currency

pence / /

/

Facility

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

IndustryTerm

output-sensitive algorithm / greedy algorithm / appropriate existing machinery / randomized expected polynomial-time algorithm / approximation algorithms / /

Organization

School of Computer Science / Cambridge University / New York University / New York / National Science Foundation / pp. / Tel Aviv University / U.S.-Israel Binational Science Foundation / NYU / Israel Science Fund / MINERVA Center for Geometry / Department of Computer Science and Engineering / Courant Institute of Mathematical Sciences / Union of Fat Triangles∗ Esther Ezra† Boris Aronov‡ Abstract We / Polytechnic Institute / /

Person

Micha Sharir / Mark de Berg / Boris Aronov / Esther Ezra / Efrat / /

/

ProvinceOrState

New York / /

Technology

randomized expected polynomial-time algorithm / Improved approximation algorithms / /

SocialTag