Back to Results
First PageMeta Content
NP-complete problems / NP-complete / Clique problem / Clique / Independent set / Parameterized complexity / Dominating set / Travelling salesman problem / NP / Theoretical computer science / Computational complexity theory / Mathematics


Document Date: 2011-04-05 11:38:18

Open Document

File Size: 178,43 KB

Share Result on Facebook

City

Berlin / Edinburgh / Stockholm / /

Company

R.E. Tarjan A.E. / S.S. Fedin A.S. / S. / Elsevier B.V. / /

/

Facility

Princeton University / Electoral College / /

IndustryTerm

famous dynamic programming algorithm / exponential time algorithms / faster algorithms / exponential time solutions / exclusion algorithm / minimal solutions / space dynamic programming algorithm / trivial enumerative algorithm / binary search / polynomial time algorithm / space algorithm / real life applications / polynomial space algorithm / balanced search tree / faster exact algorithms / travel length / linear search programs / above algorithm / faster exact algorithm / exhaustive search / trivial exact algorithm / space algorithms / /

Organization

Rutgers / Gerhard J. Woeginger Department of Mathematics and Computer Science / Princeton University / Electoral College of the United States / /

Person

Prasad / Kelly / X. Huang / V / Gerhard J. Woeginger / /

Position

model / travelling salesman / salesman / player / /

Product

Franklin / /

ProvinceOrState

District of Columbia / /

PublishedMedium

the Theory of Computing / Lecture Notes in Computer Science / /

Technology

above algorithm / famous dynamic programming algorithm / Design algorithms / Faster algorithms / polynomial time algorithm / exponential time algorithms / polynomial space algorithm / time algorithm / improved algorithm / space algorithms / exclusion algorithm / space dynamic programming algorithm / k-CLIQUE algorithms / trivial enumerative algorithm / /

URL

www.elsevier.com/locate/dam / /

SocialTag