- Home
- Best Scientists - Mathematics
- David P. Williamson

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
42
Citations
15,196
141
World Ranking
1185
National Ranking
542

Computer Science
D-index
42
Citations
15,197
141
World Ranking
5126
National Ranking
2522

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

- Algorithm
- Mathematical optimization
- Combinatorics

The scientist’s investigation covers issues in Approximation algorithm, Combinatorics, Mathematical optimization, Discrete mathematics and Maximum cut. David P. Williamson has researched Approximation algorithm in several fields, including Linear programming, Semidefinite programming, Time complexity and Analysis of algorithms. His Semidefinite programming research incorporates themes from Unique games conjecture, Randomized algorithm and Theoretical computer science.

His Combinatorics research focuses on Combinatorial optimization and how it connects with Travelling salesman problem. His Mathematical optimization study which covers Network planning and design that intersects with Primal dual and Technical report. His Maximum cut course of study focuses on Optimization problem and Boolean function and Boolean expression.

- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (2998 citations)
- A General Approximation Technique for Constrained Forest Problems (714 citations)
- The Design of Approximation Algorithms (695 citations)

David P. Williamson mainly investigates Approximation algorithm, Combinatorics, Mathematical optimization, Discrete mathematics and Travelling salesman problem. His studies in Approximation algorithm integrate themes in fields like Algorithmics, Steiner tree problem and Linear programming relaxation. David P. Williamson combines subjects such as Linear programming, Network planning and design and Relaxation with his study of Combinatorics.

In his work, Round-off error and Submodular set function is strongly intertwined with Rounding, which is a subfield of Mathematical optimization. His work on Maximum cut and Directed graph as part of general Discrete mathematics study is frequently linked to Class, bridging the gap between disciplines. His Travelling salesman problem research also works with subjects such as

- Triangle inequality and related Structure,
- Covering problems most often made with reference to Combinatorial optimization.

- Approximation algorithm (59.76%)
- Combinatorics (47.34%)
- Mathematical optimization (33.14%)

- Combinatorics (47.34%)
- Approximation algorithm (59.76%)
- Travelling salesman problem (19.53%)

His scientific interests lie mostly in Combinatorics, Approximation algorithm, Travelling salesman problem, Mathematical optimization and Spanning tree. David P. Williamson has researched Combinatorics in several fields, including Linear programming, Tree, Discrete mathematics and Extension. His Discrete mathematics research includes themes of Submodular set function and Theory of computation.

His Approximation algorithm study deals with the bigger picture of Algorithm. His studies deal with areas such as Semidefinite programming, Relaxation, Linear programming relaxation, Combinatorial optimization and Minimum spanning tree as well as Travelling salesman problem. His study in the field of Facility location problem and Optimization problem is also linked to topics like Revenue management, Sequence and New product development.

- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (16 citations)
- Network Flow Algorithms (15 citations)
- Assortment optimization over time (11 citations)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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

Michel X. Goemans;David P. Williamson.

Journal of the ACM **(1995)**

5014 Citations

The Design of Approximation Algorithms

David P. Williamson;David B. Shmoys.

**(2012)**

1386 Citations

A General Approximation Technique for Constrained Forest Problems

Michel X. Goemans;David P. Williamson.

SIAM Journal on Computing **(1995)**

1194 Citations

Scheduling Parallel Machines On-line

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

SIAM Journal on Computing **(1995)**

492 Citations

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

Michel X. Goemans;David P. Williamson.

Approximation algorithms for NP-hard problems **(1996)**

419 Citations

A note on the prize collecting traveling salesman problem

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

Mathematical Programming **(1993)**

328 Citations

Gadgets, Approximation, and Linear Programming

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

SIAM Journal on Computing **(2000)**

314 Citations

Improved approximation algorithms for network design problems

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

symposium on discrete algorithms **(1994)**

304 Citations

Short Shop Schedules

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

Operations Research **(1997)**

296 Citations

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

Michel X. Goemans;David P. Williamson.

SIAM Journal on Discrete Mathematics **(1994)**

296 Citations

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

Contact us

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:

Cornell University

Harvard University

Microsoft (United States)

Bocconi University

University of California, Irvine

University of Colorado Boulder

Cornell University

London School of Economics and Political Science

Cornell University

University of Oxford

University of Helsinki

Oracle (United States)

Queen's University

Universiti Sains Malaysia

Academia Sinica

Queen's University

University of Idaho

University of Waikato

Hebrew University of Jerusalem

Southern University of Science and Technology

Pacific Marine Environmental Laboratory

Saint Louis University

University of Gothenburg

University of Minnesota

Something went wrong. Please try again later.