13. NP-Completeness

D. B. Shmoys: “Computing Near-Optimal Solution to Combinatorial Optimization Problems”




Tilbage til hovedsiden


Januar 2003 Keld Helsgaun