Approximation

Algorithms that find a near-best solution with a proved bound.

• Covering and packing0 pages
• Scheduling approximation0 pages
• TSP approximation0 pages
• LP rounding0 pages
• Approximation schemes0 pages
• Hardness of approximation0 pages

This area has no pages yet. The coverage plan lists the pages that it needs. You can write one of them. Read how to contribute.