Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:analyzes |
Average-case Analysis
Worst-case Analysis |
| gptkbp:appliesTo |
Optimization Problem
|
| gptkbp:characterizedBy |
Approximation Ratio
|
| gptkbp:compatibleWith |
Exact Algorithm
|
| gptkbp:example |
Christofides Algorithm for TSP
Greedy Algorithm for Vertex Cover Set Cover Algorithm |
| gptkbp:field |
Computer Science
|
| gptkbp:goal |
Find near-optimal solutions
|
| gptkbp:guarantees |
Bounded Error
|
| https://www.w3.org/2000/01/rdf-schema#label |
Approximation Algorithm
|
| gptkbp:output |
Feasible Solution
|
| gptkbp:relatedTo |
gptkb:Randomized_Algorithm
Heuristic Polynomial Time Algorithm |
| gptkbp:studiedIn |
Theoretical Computer Science
|
| gptkbp:used_in |
Exact solution is hard or impossible
|
| gptkbp:usedIn |
NP-hard Problems
|
| gptkbp:bfsParent |
gptkb:Set_Covering
|
| gptkbp:bfsLayer |
7
|