What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Approximation algorithm (59.76%)
- Combinatorics (47.34%)
- Mathematical optimization (33.14%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (47.34%)
- Approximation algorithm (59.76%)
- Travelling salesman problem (19.53%)
In recent papers he was focusing on the following fields of study:
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.
Between 2014 and 2021, his most popular works were:
- 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.
