Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Combinatorial optimization / Operations research / Computational problems / Linear programming relaxation / APX / NP-complete / Boolean satisfiability problem / Theoretical computer science / Computational complexity theory / Mathematics


CCCG 2004, Montreal, Quebec, August 9–11, 2004 Separating points by axis-parallel lines  Gruia C˘alinescu
Add to Reading List

Document Date: 2004-08-23 15:27:23

Open Document

File Size: 92,99 KB

Share Result on Facebook

City

Pasadena / Montreal / Milwaukee / New York / /

Company

CNF / 3SAT / /

Country

United States / /

Currency

pence / cent / /

/

Facility

University of Wisconsin / Illinois Institute of Technology / /

IndustryTerm

approximation algorithm / polynomial time algorithm / embedded sensor networks / approximate solution / ratio approximation algorithm / computing / approximate solutions / approximation algorithms / /

Organization

UC Berkeley / Illinois Institute of Technology / Chicago / University of Wisconsin / /

Person

Adrian Dumitrescu / Jun Wan / /

Position

MP / /

ProvinceOrState

Wisconsin / Quebec / Illinois / New York / /

Technology

polynomial time algorithm / approximation algorithm / ratio approximation algorithm / second algorithm / two LP-based approximation algorithms / /

SocialTag