David P. Williamson
Identifiers
- name variant David P. Williamson 0.60 · backfill
Papers (13)
- Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP cs.DM · 2019 · author #2
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps cs.DS · 2019 · author #2
- Tight Bounds for Online Weighted Tree Augmentation cs.DS · 2019 · author #3
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem cs.DS · 2019 · author #2
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem cs.DS · 2017 · author #2
- Online Constrained Forest and Prize-Collecting Network Design cs.DS · 2017 · author #3
- Maximizing a Submodular Function with Viability Constraints cs.DS · 2016 · author #3
- Rank Aggregation: New Bounds for MCx cs.DM · 2015 · author #2
- An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem cs.DS · 2015 · author #2
- On Some Recent MAX SAT Approximation Algorithms cs.DS · 2013 · author #2
- A note on the generalized min-sum set cover problem cs.DS · 2011 · author #2
- On the Integrality Gap of the Subtour LP for the 1,2-TSP cs.DS · 2011 · author #3
- A Proof of the Boyd-Carr Conjecture cs.DS · 2011 · author #2
Mentions
Frequent Coauthors
- Samuel C. Gutekunst 4 shared papers
- Anke van Zuylen 3 shared papers
- Frans Schalekamp 2 shared papers
- Jiawei Qian 2 shared papers
- Seeun William Umboh 2 shared papers
- Daniel Freund 1 shared papers
- Joseph (Seffi) Naor 1 shared papers
- Kyle Genova 1 shared papers
- Martin Skutella 1 shared papers
- Matthias Poloczek 1 shared papers
- Monika Henzinger 1 shared papers
- Wolfgang Dvo\v{r}\'ak 1 shared papers