Jack Edmonds

Last updated
Jack Edmonds
Jack.Edmonds.jpg
Edmonds with his NP rock outside his home in Ontario, Canada
Born
John Robert Edmonds

(1934-04-05) April 5, 1934 (age 89)
Washington, D.C., U.S.
Alma mater
Known for
Awards John von Neumann Theory Prize (1985)
Scientific career
FieldsComputer Science, Mathematics
Institutions
Doctoral students

Jack R. Edmonds (born April 5, 1934) is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.

Contents

Early career

Edmonds attended Duke University before completing his undergraduate degree at George Washington University in 1957. He thereafter received a master's degree in 1960 at the University of Maryland under Bruce L. Reinhart with a thesis on the problem of embedding graphs into surfaces. [1] [2] From 1959 to 1969 he worked at the National Institute of Standards and Technology (then the National Bureau of Standards), and was a founding member of Alan Goldman’s newly created Operations Research Section in 1961. Goldman proved to be a crucial influence by enabling Edmonds to work in a RAND Corporation-sponsored workshop in Santa Monica, California. It is here that Edmonds first presented his findings on defining a class of algorithms that could run more efficiently. Most combinatorics scholars, during this time, were not focused on algorithms. However Edmonds was drawn to them and these initial investigations were key developments for his later work between matroids and optimization. He spent the years from 1961 to 1965 on the subject of NP versus P and in 1966 originated the conjectures NP ≠ P and NP ∩ coNP = P.

Research

Edmonds's 1965 paper “Paths, Trees and Flowers” was a preeminent paper in initially suggesting the possibility of establishing a mathematical theory of efficient combinatorial algorithms. One of his earliest and notable contributions is the blossom algorithm for constructing maximum matchings on graphs, discovered in 1961 [3] and published in 1965. [4] This was the first polynomial-time algorithm for maximum matching in graphs. Its generalization to weighted graphs [5] was a conceptual breakthrough in the use of linear programming ideas in combinatorial optimization. It sealed in the importance of there being proofs, or "witnesses", that the answer for an instance is yes and there being proofs, or "witnesses", that the answer for an instance is no. In this blossom algorithm paper, Edmonds also characterizes feasible problems as those solvable in polynomial time; this is one of the origins of the Cobham–Edmonds thesis. [6]

A breakthrough of the Cobham–Edmonds thesis, was defining the concept of polynomial time characterising the difference between a practical and an impractical algorithm (in modern terms, a tractable problem or intractable problem). Today, problems solvable in polynomial time are called the complexity class PTIME , or simply P .

Edmonds's paper “Maximum Matching and a Polyhedron with 0-1 Vertices” along with his previous work gave astonishing polynomial-time algorithms for the construction of maximum matchings. Most notably, these papers demonstrated how a good characterization of the polyhedron associated with a combinatorial optimization problem could lead, via the duality theory of linear programming, to the construction of an efficient algorithm for the solution of that problem.

Additional landmark work of Edmonds is in the area of matroids. He found a polyhedral description for all spanning trees of a graph, and more generally for all independent sets of a matroid. [7] Building on this, as a novel application of linear programming to discrete mathematics, he proved the matroid intersection theorem, a very general combinatorial min-max theorem [8] [9] which, in modern terms, showed that the matroid intersection problem lay in both NP and co-NP.

Edmonds is well known for his theorems on max-weight branching algorithms [10] and packing edge-disjoint branchings [11] and his work with Richard Karp on faster flow algorithms. The Edmonds–Gallai decomposition theorem describes finite graphs from the point of view of matchings. He introduced polymatroids, [8] submodular flows with Richard Giles, [12] and the terms clutter and blocker in the study of hypergraphs. [3] A recurring theme in his work [13] is to seek algorithms whose time complexity is polynomially bounded by their input size and bit-complexity. [3]

Career

From 1969 on, with the exception of 1991–1993, he held a faculty position at the Department of Combinatorics and Optimization at the University of Waterloo's Faculty of Mathematics where his research encompassed combinatorial optimization problems and associated polyhedra. He supervised the doctoral work of a dozen students in this time.

From 1991 to 1993, he was involved in a dispute ("the Edmonds affair") with the University of Waterloo, [14] [15] wherein the university claimed that a letter submitted constituted a letter of resignation, which Edmonds denied. [16] The conflict was resolved in 1993, and he returned to the university.

Edmonds retired from the University of Waterloo in 1999.

Awards and honors

Edmonds was the 1985 recipient of the John von Neumann Theory Prize.

In 2001 his paper, "Paths, Trees and Flowers" was honoured as an Outstanding Publication by the National Institute of Standards and Technology in their celebratory edition of A Century of Excellence in Measurements Standards and Technology

He was elected to the 2002 class of Fellows of the Institute for Operations Research and the Management Sciences. [17]

In 2006 the Queen of Denmark presented Edmonds with an Honorary Doctorate from the University of Southern Denmark.

In 2014 he was honored as a Distinguished Scientist and inducted into the National Institute of Standards and Technology's Gallery.

The fifth Aussois Workshop on Combinatorial Optimization in 2001 was dedicated to him. [9]

Personal life

Jack's son Jeff Edmonds is a professor of computer science at York University, and his wife Kathie Cameron is a professor of mathematics at Laurier University.

See also

Related Research Articles

<span class="mw-page-title-main">Linear programming</span> Method to solve some optimization problems

Linear programming (LP), also called linear optimization, is a method to achieve the best outcome in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming.

<span class="mw-page-title-main">Greedy algorithm</span> Sequence of locally optimal choices

A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time.

<span class="mw-page-title-main">Chinese postman problem</span> Finding shortest walks through all graph edges

In graph theory, a branch of mathematics and computer science, Guan's route problem, the Chinese postman problem, postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of an (connected) undirected graph at least once. When the graph has an Eulerian circuit, that circuit is an optimal solution. Otherwise, the optimization problem is to find the smallest number of graph edges to duplicate so that the resulting multigraph does have an Eulerian circuit. It can be solved in polynomial time.

<span class="mw-page-title-main">Richard M. Karp</span> American mathematician

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.

<span class="mw-page-title-main">Discrete geometry</span> Branch of geometry that studies combinatorial properties and constructive methods

Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.

<span class="mw-page-title-main">Combinatorial optimization</span> Subfield of mathematical optimization

Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead.

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

<span class="mw-page-title-main">Dual graph</span> Graph representing faces of another graph

In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e. The definition of the dual depends on the choice of embedding of the graph G, so it is a property of plane graphs rather than planar graphs. For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.

<span class="mw-page-title-main">Factor-critical graph</span> Graph of n vertices with a perfect matching for every subgraph of n-1 vertices

In graph theory, a mathematical discipline, a factor-critical graph is a graph with n vertices in which every subgraph of n − 1 vertices has a perfect matching.

<span class="mw-page-title-main">Branch-decomposition</span> Hierarchical clustering of graph edges

In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree T with the edges of G as its leaves. Removing any edge from T partitions the edges of G into two subgraphs, and the width of the decomposition is the maximum number of shared vertices of any pair of subgraphs formed in this way. The branchwidth of G is the minimum width of any branch-decomposition of G.

Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.

In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight. These problems generalize many problems in combinatorial optimization including finding maximum matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed graphs.

In graph theory, the blossom algorithm is an algorithm for constructing maximum matchings on graphs. The algorithm was developed by Jack Edmonds in 1961, and published in 1965. Given a general graph G = (V, E), the algorithm finds a matching M such that each vertex in V is incident with at most one edge in M and |M| is maximized. The matching is constructed by iteratively improving an initial empty matching along augmenting paths in the graph. Unlike bipartite matching, the key new idea is that an odd-length cycle in the graph (blossom) is contracted to a single vertex, with the search continuing iteratively in the contracted graph.

<span class="mw-page-title-main">Integral polytope</span> A convex polytope whose vertices all have integer Cartesian coordinates

In geometry and polyhedral combinatorics, an integral polytope is a convex polytope whose vertices all have integer Cartesian coordinates. That is, it is a polytope that equals the convex hull of its integer points. Integral polytopes are also called lattice polytopes or Z-polytopes. The special cases of two- and three-dimensional integral polytopes may be called polygons or polyhedra instead of polytopes, respectively.

Eugene Leighton (Gene) Lawler was an American computer scientist and a professor of computer science at the University of California, Berkeley.

In mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial structure that can be used to describe the linear dependencies between vectors in a vector space or the spanning trees of a graph, among other applications.

In the mathematical theory of matroids, the rank of a matroid is the maximum size of an independent set in the matroid. The rank of a subset S of elements of the matroid is, similarly, the maximum size of an independent subset of S, and the rank function of the matroid maps sets of elements to their ranks.

Independence Theory in Combinatorics: An Introductory Account with Applications to Graphs and Transversals is an undergraduate-level mathematics textbook on the theory of matroids. It was written by Victor Bryant and Hazel Perfect, and published in 1980 by Chapman & Hall.

In the theory of combinatorial optimization, submodular flow is a general class of optimization problems that includes as special cases the minimum-cost flow problem, matroid intersection, and the problem of computing a minimum-weight dijoin in a weighted directed graph. It was originally formulated by Jack Edmonds and Rick Giles, and can be solved in polynomial time.

References

  1. ↑ "Jack Edmonds". The Mathematics Genealogy Project. Retrieved 23 June 2022.
  2. ↑ Edmonds Jr., John Robert (1960). A combinatorial representation for oriented polyhedral surfaces . Retrieved 23 June 2022.
  3. 1 2 3 Edmonds, Jack (1991), "A glimpse of heaven", in J.K. Lenstra; A.H.G. Rinnooy Kan; A. Schrijver (eds.), History of Mathematical Programming – A Collection of Personal Reminiscences, CWI, Amsterdam and North-Holland, Amsterdam, pp. 32–54
  4. ↑ Edmonds, Jack (1965). "Paths, trees, and flowers". Can. J. Math. 17: 449–467. doi:10.4153/CJM-1965-045-4. S2CID   247198603.
  5. ↑ Edmonds, Jack (1965). "Maximum matching and a polyhedron with 0,1-vertices". Journal of Research of the National Bureau of Standards Section B. 69 (1 and 2): 125–130. doi: 10.6028/jres.069B.013 .
  6. ↑ Meurant, Gerard (2014). Algorithms and Complexity. p.  p. 4. ISBN   978-0-08093391-7. A problem is said to be feasible if it can be solved in polynomial time (as stated for the first time in Edmonds [26] [1965, Paths, trees, and flowers])).
  7. ↑ Edmonds, Jack (1971). "Matroids and the greedy algorithm". Math. Programming (Princeton Symposium Math. Prog. 1967). 1: 127–136.
  8. 1 2 Edmonds, Jack (1970). "Submodular functions, matroids, and certain polyhedra". In R. Guy; H. Hanam; N. Sauer; J. Schonheim (eds.). Combinatorial structures and their applications (Proc. 1969 Calgary Conference). Gordon and Breach, New York. pp. 69–87..
  9. 1 2 Jünger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni, eds. (2003), Combinatorial Optimization – Eureka, You Shrink!, Lecture Notes in Computer Science, vol. 2570, Springer
  10. ↑ Edmonds, Jack (1967). "Optimum Branchings". Journal of Research of the National Bureau of Standards Section B. 71B (4): 233–240. doi: 10.6028/jres.071B.032 .
  11. ↑ Edmonds, Jack (1973), R. Rustin (ed.), "Edge-disjoint branchings", Combinatorial Algorithms |Courant Computer Science Symposium 9, 1972, Monterey, California, 1972: Algorithmics Press, New York: 91–96{{citation}}: CS1 maint: location (link)
  12. ↑ Edmonds, Jack; Giles, Richard (1977), P.L. Hammer; E.L. Johnson; B.H. Korte; G.L. Nemhauser (eds.), "A min-max relation for submodular functions on graphs", Studies in Integer Programming | Proceedings Workshop on Integer Programming, Bonn, 1975, Annals of Discrete Mathematics, North-Holland, Amsterdam, 1: 185–204, doi:10.1016/S0167-5060(08)70734-9, ISBN   9780720407655
  13. ↑ Christoph Witzgall (2001), "Paths, Trees, and Flowers", A Century of Excellence in Measurements, Standards, and Technology (PDF), National Institute of Standards and Technology, pp. 140–144, archived from the original (PDF) on 2006-03-25, retrieved 2011-08-11
  14. ↑ UW Gazette, October 7, 1992: CAUT called in on Jack Edmonds case
  15. ↑ Editor's introduction Archived 2010-10-27 at the Wayback Machine , in: Kenneth Westhues, ed., Workplace Mobbing in Academe: Reports from Twenty Universities, Lewiston: NY: The Edwin Mellen Press, 2004
  16. ↑ University of Waterloo Daily Bulletin, March 5 2001: Conference honours Jack Edmonds
  17. ↑ Fellows: Alphabetical List, Institute for Operations Research and the Management Sciences, archived from the original on 2019-05-10, retrieved 2019-10-09
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.