World's Best Scientists 2026 revealed!
David P. Williamson

David P. Williamson

D-Index & Metrics

Computer Science

D-Index
49
Citations
16663
World Ranking
5758
National Ranking
2618

Mathematics

D-Index
49
Citations
16655
World Ranking
1116
National Ranking
513

Research.com Recognitions

  • 2016 - SIAM Fellow For fundamental contributions to the design and analysis of approximation algorithms.
  • 2013 - ACM Fellow For contributions to the design and analysis of approximation algorithms.
  • 2008 - SPIE Fellow

Overview

David P. Williamson is affiliated with Cornell University in the United States and has a significant body of work in the fields of Computer Science and Engineering.

Their research spans several subfields, including Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Artificial Intelligence, Computer Networks and Communications, and Management Information Systems.

David P. Williamson's main topics of work include:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Vehicle Routing Optimization Methods
  • Optimization and Search Problems
  • Optimization and Packing Problems
  • Nuclear Receptors and Signaling
  • Machine Learning and Algorithms

Frequent co-authors collaborating with Williamson are:

  • Billy Jin
  • Renee Mirka
  • Samuel C. Gutekunst
  • Nathan Klein
  • Monika Henzinger

David P. Williamson publishes regularly in prominent venues, the most frequent of which include:

  • arXiv (Cornell University)
  • Mathematics of Operations Research
  • Mathematical Programming
  • Operations Research Letters
  • Algorithmica

Selected recent papers authored or co-authored by Williamson include:

  • "Fluid Approximations for Revenue Management Under High-Variance Demand," 2023, Management Science
  • "An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut," 2023, ACM Journal of Experimental Algorithmics
  • "Optimal Algorithms for Online b-Matching with Variable Vertex Capacities," 2021, arXiv (Cornell University)
  • "Erratum to 'Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems'," 2022, Mathematics of Operations Research
  • "A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems," 2023, Algorithmica

In addition to journal and conference papers, Williamson has contributed to book publications. Notably, they authored "Integer Programming and Combinatorial Optimization" published by Springer Science+Business Media in 2021.

Williamson's contributions have been recognized with several awards, including:

  • SIAM Fellow (2016) for fundamental contributions to the design and analysis of approximation algorithms
  • ACM Fellow (2013) for contributions to the design and analysis of approximation algorithms
  • SPIE Fellow (2008)

Best Publications

  • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

    Michel X. Goemans;David P. Williamson

  • The Design of Approximation Algorithms

    David P. Williamson;David B. Shmoys

  • A General Approximation Technique for Constrained Forest Problems

    Michel X. Goemans;David P. Williamson

  • Scheduling Parallel Machines On-line

    David B. Shmoys;Joel Wein;David P. Williamson

  • The primal-dual method for approximation algorithms and its application to network design problems

    Michel X. Goemans;David P. Williamson

  • A note on the prize collecting traveling salesman problem

    Daniel Bienstock;Michel X. Goemans;David Simchi-Levi;David Williamson

  • Gadgets, Approximation, and Linear Programming

    Luca Trevisan;Gregory B. Sorkin;Madhu Sudan;David P. Williamson

  • Improved approximation algorithms for network design problems

    M. X. Goemans;A. V. Goldberg;S. Plotkin;D. B. Shmoys

  • Short Shop Schedules

    D. P. Williamson;L. A. Hall;J. A. Hoogeveen;C. A. J. Hurkens

  • New ${f rac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem

    Michel X. Goemans;David P. Williamson

  • A primal-dual approximation algorithm for generalized steiner network problems

    David P. Williamson;Michel X. Goemans;Milena Mihail;Vijay V. Vazirani

  • Adversarial queuing theory

    Allan Borodin;Jon Kleinberg;Prabhakar Raghavan;Madhu Sudan

  • .879-approximation algorithms for MAX CUT and MAX 2SAT

    Michel X. Goemans;David P. Williamson

  • Improved approximation algorithms for capacitated facility location problems

    Fabián A. Chudak;David P. Williamson

  • Searching the workplace web

    Ronald Fagin;Ravi Kumar;Kevin S. McCurley;Jasmine Novak

  • The Approximability of Constraint Satisfaction Problems

    Sanjeev Khanna;Madhu Sudan;Luca Trevisan;David P. Williamson

  • System, method and service for ranking search results using a modular scoring system

    Ronald Fagin;Kevin Snow McCurley;Jasmine Novak;Shanmugasundram Ravikumar

  • An adaptive algorithm for selecting profitable keywords for search-based advertising services

    Paat Rusmevichientong;David P. Williamson

  • Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

    Michel X. Goemans;David Williamson

  • Adversarial queueing theory

    Allan Borodin;Jon Kleinberg;Prabhakar Raghavan;Madhu Sudan

  • Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • The Design of Approximation Algorithms: Further Uses of Random Sampling and Randomized Rounding of Linear Programs

    David P. Williamson;David B. Shmoys

  • The Design of Approximation Algorithms: Random Sampling and Randomized Rounding of Linear Programs

    David P. Williamson;David B. Shmoys

Frequent Co-Authors

David B. Shmoys
David B. Shmoys Cornell University
Madhu Sudan
Madhu Sudan Harvard University
Kamal Jain
Kamal Jain Microsoft (United States)
Luca Trevisan
Luca Trevisan Bocconi University
Harold N. Gabow
Harold N. Gabow University of Colorado Boulder
Jon Kleinberg
Jon Kleinberg Cornell University
Vijay V. Vazirani
Vijay V. Vazirani University of California, Irvine
Gregory B. Sorkin
Gregory B. Sorkin London School of Economics and Political Science
Éva Tardos
Éva Tardos Cornell University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, pursuing related online degrees can open diverse career pathways. Many professionals consider complementing their mathematical skills with business knowledge by enrolling in an online MBA with transfer credits accepted. This option allows for flexibility and recognizes prior coursework, making the journey more efficient and cost-effective.

Additionally, the field of data analytics is a natural extension for math graduates interested in big data and decision-making roles. A masters in data analytics prepares students with the technical and analytical skills required to thrive in industries such as finance, healthcare, and technology.

For those who want to enter management roles quickly, exploring the easiest MBA program options can be beneficial, providing an accelerated path without compromising foundational business knowledge. Some professionals prefer programs listed under easiest MBA program selections, which balance accessibility and quality, ideal for working individuals seeking career advancement.

Overall, combining mathematics with business or analytics enhances career flexibility, offering strong prospects in a rapidly evolving job market.

Best Scientists Citing David P. Williamson

Trending Scientists

Recently Published Articles