David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
David B. Shmoys
Latest
Erratum to 'Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems'
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
Prize-Collecting TSP with a Budget Constraint
The Design of Approximation Algorithms
Approximation Algorithms.
Scheduling parallel machines on-line.
Permutation vs. non-permutation flow shop schedules.
Analyzing the Held-Karp TSP bound: A monotonicity property with application.
Cite
×