The Euclidean Matching Problem pp 5-23 | Cite as

# Graphs and Optimization

Chapter

First Online:

- 406 Downloads

## Abstract

The matching problem is an important combinatorial problem defined on a *graph*. Graphs provide very often a pictorial representation of the mathematical structure underlying combinatorial optimization problems. On the other hand, graph theory is by itself rich of elegant results that can give us useful insights on many combinatorial and physical problems. For these reasons, we present here a very short introduction to the basic definitions and results of graph theory. We will refer mostly to the standard textbook of Diestel [3].

## Keywords

Linear Optimization Problem Simplex Tableau Hungarian Algorithm Eulerian Subgraph Computational Complexity Classes
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

- 1.C. Berge,
*Graphs and Hypergraphs*(North-Holland Mathematical Library, Amsterdam, 1973)zbMATHGoogle Scholar - 2.G. Dantzig, M. Thapa,
*Linear Programming 1: Introduction*, Springer Series in Operations Research and Financial Engineering (Springer, New York, 1997)zbMATHGoogle Scholar - 3.R. Diestel,
*Graph Theory*, Springer Graduate Texts in Mathematics (GTM) (Springer,Heidelberg, 2012)Google Scholar - 4.E. Dinic, M. Kronrod, An algorithm for the solution of the assignment problem. Sov. Math. Dokl.
**10**(6), 1324–1326 (1969)zbMATHGoogle Scholar - 5.J. Edmonds, R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM (JACM)
**19**(2), 248–264 (1972)CrossRefzbMATHGoogle Scholar - 6.D. Jungnickel, T. Schade,
*Graphs, Networks and Algorithms*(Springer, Berlin, 2005)Google Scholar - 7.V. Klee, G.J. Minty, How good is the simplex algorithm. Technical report, DTIC Document (1970)Google Scholar
- 8.H.W. Kuhn, The Hungarian method for the assignment problem. Nav. Res. Logist. Q.
**2**, 83–97 (1955)MathSciNetCrossRefzbMATHGoogle Scholar - 9.L. Lovász, D. Plummer,
*Matching Theory*. AMS Chelsea Publishing Series (AMS, Providence, 2009)Google Scholar - 10.C. Moore, S. Mertens,
*The Nature of Computation*(OUP, Oxford, 2011)CrossRefzbMATHGoogle Scholar - 11.J. Munkres, Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math.
**5**(1), 32–38 (1957)MathSciNetCrossRefzbMATHGoogle Scholar - 12.C. Papadimitriou,
*Computational Complexity*, Theoretical computer science (Addison-Wesley, Reading, 1994)zbMATHGoogle Scholar - 13.C. Papadimitriou, K. Steiglitz,
*Combinatorial Optimization: Algorithms and Complexity*, Dover Books on Computer Science Series (Dover Publications, Mineola, 1998)zbMATHGoogle Scholar

## Copyright information

© Springer International Publishing AG 2017