Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / NP-complete problems / Combinatorial optimization / Approximation algorithm / NP-complete / Hardness of approximation / Optimization problem / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics


How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡
Add to Reading List

Document Date: 1998-12-21 18:16:27

Open Document

File Size: 49,49 KB

Share Result on Facebook

City

San Francisco / Firenze / Boston / Stockholm / /

Company

Dell / SIAM J. Comp / PWS Publishing Company / Vertex / Yahoo / Altavista / /

Country

United States / Italy / Sweden / /

/

Event

Bankruptcy / /

Facility

Royal Institute of Technology / /

IndustryTerm

web compendium / dependent randomized rounding algorithms / approximation algorithm / feasible solution / polynomial time algorithm / prover proof systems / approximate solution / web forms / algorithm web page / web indexes / web version / feasible solutions / approximation algorithms / /

Organization

Department of Numerical Analysis and Computing Science / IN V / AL PO / Institute of Technology / IEEE Computer Society / ND SP / /

Person

MAX DICUT / Kirk Pruhs / Gerhard Woeginger / GT ND SP SR / Marek Karpinski / /

Position

researcher / /

ProgrammingLanguage

Postscript / /

PublishedMedium

Theory of Computing / /

Technology

4/3-approximation algorithm / polynomial time algorithm / approximation algorithm / incredible 1.0741approximation algorithm / 2-approximation algorithm / approximation algorithms / MP3 / dependent randomized rounding algorithms / /

URL

http /

SocialTag