The following pages link to David P. Williamson (Q324760):
Displaying 50 items.
- The online prize-collecting facility location problem (Q324761) (← links)
- A note on the generalized min-sum set cover problem (Q408432) (← links)
- Maximizing a submodular function with viability constraints (Q513299) (← links)
- (Q679444) (redirect page) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- A note on the prize collecting traveling salesman problem (Q687042) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
- Permutation vs. non-permutation flow shop schedules (Q1180831) (← links)
- Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q1307344) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- Rank aggregation: new bounds for MCx (Q1630773) (← links)
- Greedy algorithms for the single-demand facility location problem (Q1728306) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← links)
- Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
- Assortment optimization over time (Q1785447) (← links)
- Offline and online facility leasing (Q1799393) (← links)
- On the number of small cut in a graph (Q1847367) (← links)
- The primal-dual method for approximation algorithms (Q1849526) (← links)
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems (Q1849676) (← links)
- Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation (Q1881568) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model (Q2152115) (← links)
- The two-stripe symmetric circulant TSP is in P (Q2164712) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (Q2183196) (← links)
- A 3/2-approximation algorithm for some minimum-cost graph problems (Q2340276) (← links)
- On the integrality gap of the subtour LP for the 1,2-TSP (Q2340281) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- Popular ranking (Q2448918) (← links)
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy (Q2467439) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- The Approximability of Constraint Satisfaction Problems (Q2706139) (← links)
- Improved Approximation Algorithms for MAX SAT (Q2777611) (← links)
- Simple Approximation Algorithms for Balanced MAX 2SAT (Q2802976) (← links)
- .879-approximation algorithms for MAX CUT and MAX 2SAT (Q2817633) (← links)
- On the Integrality Gap of the Subtour LP for the 1,2-TSP (Q2894502) (← links)
- A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems (Q2912855) (← links)
- (Q2921713) (← links)
- (Q2934723) (← links)
- Adversarial queuing theory (Q2947002) (← links)
