| Boyer-Moore String-Search-Algorithm |
Text processing |
 |
1 |
1 |
| Knuth–Morris–Pratt Algorithm |
Text processing |
 |
1 |
1 |
| Standard, Compressed, Suffix Tries |
Text processing |
 |
1 |
1 |
| Huffman Coding |
Text processing |
 |
1 |
1 |
| Vertex Cover |
NP-Complete |
|
2 |
|
| Travelling Salesman Problem (TSP) |
NP-Hard |
|
|
|
| Set Cover Problem |
NP-Complete |
|
2 |
|
| Linear Programming (LP) |
|
|
|
|
| Integer Programming (ILP) |
NP-Hard |
|
3 |
|
| Deterministic Rounding Algorithm |
Solve LP-Relaxation |
|
2 |
|
| Hamiltonian Cycle |
NP-Complete |
|
|
|
| Euler Tour |
|
|
|
|
| MST |
|
|
|
|
| Scheduling Jobs |
|
|
2 |
|
| Double Tree Algorithm |
|
|
2 |
|
| Christifides Algorithm |
MST + Eulerian Tour |
|
2 |
|
| Edge Coloring |
|
|
|
|
| Knapsack Problem |
|
|
|
|
| Bin Packing Problem |
+ Harmonic grouping |
|
3 |
|
| First Fit |
|
|
|
|
| Linear Grouping |
|
|
|
|
| Max Sat / Max Cut |
|
|
|
|
| Greedy Algorithm |
|
|
2 |
|
| Nearest Addition Algorithm |
|
|
2 |
|
| Triangle In-Equal |
|
|
2 |
|
| Dynamic Programming |
|
|
3 |
3 |
| Shortest Remaining Prog Time |
|
|
3 |
3 |
| First Fit Decreasing |
|
|
3 |
|