David P. Williamson
机构: Professor of Operations Research, Cornell University
每年引用次数
引用次数
引用: 16,323
H-指数: 47
I10-指数 : 79
出版物: 190
Lecture notes on approximation algorithms: Fall 1998
D. Williamson
Cornell University Operations Research and Industrial Engineering
1
1999
Lecture Notes on Network Flow Spring 2004
D. Williamson
Cornell University Operations Research and Industrial Engineering
2007
A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction
Madhu Sudan , David P. Williamson , Sanjeev Khanna
Electronic Colloquium on Computational Complexity 3
2
1996
A Short Primer on the Primal-Dual Method for Approximation Algorithms (Algorithm Engineering as a New Paradigm)
David P. Williamson
数理解析研究所講究録 1185 221 -230
2001
Integer programming and combinatorial optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007 : proceedings
Matteo Fischetti , David P. Williamson
Springer
2007
A proof of the Boyd-Carr conjecture
Anke van Zuylen , Frans Schalekamp , David P. Williamson
symposium on discrete algorithms 1477 -1486
10
2012
The Design of Approximation Algorithms
David P. Williamson , David B. Shmoys
1,577
2011
Approximation algorithms for prize collecting forest problems with submodular penalty functions
David P. Williamson , Chaitanya Swamy , Yogeshwer Sharma
symposium on discrete algorithms 1275 -1284
39
2007
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
Michel X. Goemans , Harold N. Gabow , Éva Tardos , David P. Williamson
Networks 53 ( 4) 345 -357
42
2009
A general approach for incremental approximation and hierarchical clustering
Chandrashekhar Nagarajan , Rajmohan Rajaraman , David P. Williamson , Guolong Lin
symposium on discrete algorithms 1147 -1156
22
2006
A general approximation technique for constrained forest problems
Michel X. Goemans , David P. Williamson
symposium on discrete algorithms 307 -316
1,102
1992
Prize-Collecting TSP with a Budget Constraint
David P. Williamson , Daniel Freund , Aaron Ferber , Alice Paul
european symposium on algorithms 14
3
2017
Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Matteo Fischetti , David P. Williamson
2007
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
David P. Williamson , Kyle Genova
arXiv: Data Structures and Algorithms
9
2015
Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time
Iddo Drori , David P. Williamson , Madeleine Udell , Suwen Ge
international conference on machine learning and applications 19 -24
2020
Improved Approximation Algorithms for MAX SAT
Takao Asano , David P. Williamson
Journal of Algorithms 42 ( 1) 173 -202
98
2002
Improved Approximation Algorithms for Capacitated Facility Location Problems
Fabián A. Chudak , David P. Williamson
integer programming and combinatorial optimization 99 -113
103
1999
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans , David P. Williamson
Journal of the ACM 42 ( 6) 1115 -1145
3,013
1995
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
Kyle Genova , David P. Williamson
Algorithmica 78 ( 4) 1109 -1130
3
2017
Online Constrained Forest and Prize-Collecting Network Design
Jiawei Qian , Seeun William Umboh , David P. Williamson
Algorithmica 80 ( 11) 3335 -3364
3
2018