Back to Results
First PageMeta Content
Operations research / NP-complete problems / Combinatorial optimization / Approximation algorithms / Travelling salesman problem / Christofides algorithm / Polynomial-time approximation scheme / Optimization problem / Knapsack problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Coping With NP-Hardness Approximation Algorithms
Add to Reading List

Document Date: 2001-05-07 12:05:44

Open Document

File Size: 140,63 KB

Share Result on Facebook

Facility

Princeton University / /

IndustryTerm

polynomial algorithm / dynamic programming algorithm / intuitive algorithms / feasible solution / approximation algorithm / Brute-force algorithms / Greedy algorithm / approximation algorithms / /

Organization

Princeton University / Union of MST / /

Person

Kevin Wayne / /

ProgrammingLanguage

V / TSP / /

Technology

2 Coping With NP-Hardness Approximation Algorithms / 1.5-approximation algorithm / approximation algorithms / dynamic programming algorithm / 35 36 Load Balancing Load Balancing Greedy algorithm / Load Balancing / Brute-force algorithms / 3 4 Approximation Algorithms / approximation algorithm / Coping With NP-Hardness Approximation Algorithms / 13 Approximation Algorithms / 2-approximation algorithm / time algorithm / polynomial algorithm / /

SocialTag