David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Network Design
An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
The primal-dual method for approximation algorithms and its application to network design problems.
Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances.
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems.
A general approximation technique for constrained forest problems.
Approximating minimum-cost graph problems with spanning tree edges.
Improved approximation algorithms for network design problems.
On the design of approximation algorithms for a class of graph problems.
A note on the prize-collecting traveling salesman problem.
«
Cite
×