Back to Results
First PageMeta Content
Mathematical optimization / Linear programming / Computational complexity theory / Combinatorial optimization / Operations research / Semidefinite programming / Linear programming relaxation / Relaxation / Constraint satisfaction problem / Theoretical computer science / Mathematics / Applied mathematics


Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra A dissertation submitted in partial fulfillment
Add to Reading List

Document Date: 2009-10-30 11:58:51

Open Document

File Size: 2,41 MB

Share Result on Facebook

City

Ann Arbor / /

Company

Simple LP / /

Facility

University of Washington / Engineering University of Washington Graduate School This / Signature Date University of Washington Abstract Approximating NP-hard Problems Efficient Algorithms / Philosophy University of Washington / /

IndustryTerm

generic algorithm / approximation algorithm / optimum solution / approximation algorithms / /

Organization

Supervisory Committee / University of Washington / Graduate School / Organization of Thesis / Venkatesan Guruswami Reading Committee / University of Washington Abstract Approximating NP-hard Problems Efficient Algorithms / /

Person

Prasad Raghavendra / Paul Beame James / Venkatesan Guruswami / James R Lee / /

/

Position

author / Chair / General / Associate Professor / Professor / /

ProvinceOrState

Michigan / /

Technology

generic algorithm / approximation algorithms / known algorithms / approximation algorithm / /

SocialTag