David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Network Design
Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem in Graphs
Tight Bounds for Online Weighted Tree Augmentation
Tight Bounds for Online Weighted Tree Augmentation
Online Constrained Forest and Prize-Collecting Network Design
A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem
A 3/2-approximation algorithm for some minimum-cost graph problems
The Online Connected Facility Location Problem
A dual-fitting 3/2-approximation algorithm for some minimum-cost graph problems
An O(log n)-competitive algorithm for online constrained forest problems
A general approach for incremental approximation and hierarchical clustering.
»
Cite
×