guglsafety.blogg.se - Owly volume 1

Thomas Rothvoss for his work on the extension complexity of the matching polytope.

Robert Morris, Yoshiharu Kohayakawa, Simon Griffiths, Peter Allen, and Julia Böttcher for The chromatic thresholds of graphs.

Francisco Santos Leal for a counter-example of the Hirsch conjecture.

László Lovász and Balázs Szegedy for characterizing subgraph multiplicity in sequences of dense graphs.

Vu for determining the threshold of edge density above which a random graph can be covered by disjoint copies of a given smaller graph.

Anders Johansson, Jeff Kahn, and Van H.

Sanjeev Arora, Satish Rao, and Umesh Vazirani for improving the approximation ratio for graph separators and related problems from O ( log ⁡ n ).

Ferguson, for proving the Kepler conjecture on the densest possible sphere packings. Spielman and Shang-Hua Teng, for smoothed analysis of linear programming algorithms.

Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas, for the strong perfect graph theorem.

Neil Robertson and Paul Seymour, for the Robertson–Seymour theorem showing that graph minors form a well-quasi-ordering.

Mark Jerrum, Alistair Sinclair and Eric Vigoda, for approximating the permanent.

Manindra Agrawal, Neeraj Kayal and Nitin Saxena, for the AKS primality test.

Satoru Iwata, Lisa Fleischer, Satoru Fujishige, and Alexander Schrijver for showing submodular minimization to be strongly polynomial.Bertrand Guenin for a forbidden minor characterization of the weakly bipartite graphs (graphs whose bipartite subgraph polytope is 0-1).Kapoor for the GF(4) case of Rota's conjecture on matroid minors. Rao for recognizing balanced 0-1 matrices in polynomial time. Michele Conforti, Gérard Cornuéjols, and M.Williamson for approximation algorithms based on semidefinite programming. Jeong Han Kim for finding the asymptotic growth rate of the Ramsey numbers R(3, t).

Neil Robertson, Paul Seymour and Robin Thomas for the six-color case of Hadwiger's conjecture.Gil Kalai for making progress on the Hirsch conjecture by proving subexponential bounds on the diameter of d-dimensional polytopes with n facets.Louis Billera for finding bases of piecewise-polynomial function spaces over triangulations of space.Mnev for Mnev's universality theorem, that every semialgebraic set is equivalent to the space of realizations of an oriented matroid. Alfred Lehman for 0,1-matrix analogues of the theory of perfect graphs.Frieze and Ravindran Kannan for random-walk-based approximation algorithms for the volume of convex bodies. Narendra Karmarkar for Karmarkar's algorithm for linear programming.Éva Tardos for finding minimum cost circulations in strongly polynomial time.Luks for a polynomial time graph isomorphism algorithm for graphs of bounded maximum degree. for using the geometry of numbers to solve integer programs with few variables in time polynomial in the number of constraints. Jozsef Beck for tight bounds on the discrepancy of arithmetic progressions.Falikman for proving van der Waerden's conjecture that the matrix with all entries equal has the smallest permanent of any doubly stochastic matrix. Judin, Arkadi Nemirovski, Leonid Khachiyan, Martin Grötschel, László Lovász and Alexander Schrijver for the ellipsoid method in linear programming and combinatorial optimization. Paul Seymour for generalizing the max-flow min-cut theorem to matroids.Kenneth Appel and Wolfgang Haken for the four color theorem.Karp for classifying many important NP-complete problems. Source: Mathematical Optimization Society