David P. Williamson
Cornell University
H-index: 47
North America-United States
Top articles of David P. Williamson
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Max cut and semidefinite rank | Operations Research Letters | Renee Mirka David P Williamson | 2024/3/1 |
Graph coloring and semidefinite rank | Mathematical Programming | Renee Mirka Devin Smedira David P Williamson | 2024/4/24 |
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP | Billy Jin Nathan Klein David P Williamson | 2023/5/22 | |
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems | Leibniz international proceedings in informatics | Monika Henzinger Billy Jin Richard Peng David P Williamson | 2023/1 |
A Lower Bound for the Max Entropy Algorithm for TSP | arXiv preprint arXiv:2311.01950 | Billy Jin Nathan Klein David P Williamson | 2023/11/3 |
GILP: An Interactive Tool for Visualizing the Simplex Algorithm | Henry W Robbins Samuel C Gutekunst David B Shmoys David P Williamson | 2023/3/2 | |
Integer programming and combinatorial optimization (IPCO) 2021 | Alberto Del Pia Volker Kaibel | 2023/5/21 | |
Erratum to “budgeted prize-collecting traveling salesman and minimum spanning tree problems” | Mathematics of Operations Research | Alice Paul Daniel Freund Aaron Ferber David B Shmoys David P Williamson | 2023/11 |
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP | Mathematics of Operations Research | Samuel C Gutekunst David P Williamson | 2023/2 |
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut | ACM Journal of Experimental Algorithmics | Renee Mirka David P Williamson | 2023/8/11 |
Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem in Graphs | Emmett Breen Renee Mirka Zichen Wang David P Williamson | 2023 | |
Fluid approximations for revenue management under high-variance demand | Management Science | Yicheng Bai Omar El Housni Billy Jin Paat Rusmevichientong Huseyin Topaloglu | 2023/7 |
The Two-Stripe Symmetric Circulant TSP is in P | Samuel C Gutekunst Billy Jin David P Williamson | 2022/5/27 | |
Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps | Mathematics of Operations Research | Samuel C Gutekunst David P Williamson | 2022/2 |
Tight bounds for online weighted tree augmentation | Algorithmica | Joseph Naor Seeun William Umboh David P Williamson | 2022/2 |
Recursive random contraction revisited | David R Karger David P Williamson | 2021 | |
Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model | Billy Jin David P Williamson | 2021/12/14 | |
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows | arXiv preprint arXiv:2109.00653 | Monika Henzinger Billy Jin Richard Peng David P Williamson | 2021/9/2 |
Learning to solve combinatorial optimization problems on real-world graphs in linear time | IEEE International Conference on Machine Learning and Applications | Iddo Drori Anant Kharkar William R Sickinger Brandon Kates Qiang Ma | 2020/12 |
Budgeted prize-collecting traveling salesman and minimum spanning tree problems | Mathematics of Operations Research | Alice Paul Daniel Freund Aaron Ferber David B Shmoys David P Williamson | 2020/5 |
Co-Authors
