Seminar WS 1996/97
Approximationsalgorithmen für NP-harte Probleme

1. Einführung
2. Traveling Salesman Problem
3. Computing Near Optimal Schedules
4. Weighted Vertex Cover Problem
5. Primal Dual Method for Approximation Algorithms I
6. Primal Dual Method for Approximation Algorithms II
7. Shortest Superstring Problem
8. Multiple Sequence Alignment
9. Bottleneck Problems
10. Maximum Satisfiability
11. MAXSNP Completeness
12. Hardness of Approximation
13. Approximationsschemata
14. Pseudopolynomial Algorithms
15. PAS for bin-packing
16. FPAS for bin-packing

• Einführungen
• Über dieses Dokument ...