Book contents
- Frontmatter
- Contents
- Preface
- 1 Introduction
- 2 Preliminaries
- 3 Matching and vertex cover in bipartite graphs
- 4 Spanning trees
- 5 Matroids
- 6 Arborescence and rooted connectivity
- 7 Submodular flows and applications
- 8 Network matrices
- 9 Matchings
- 10 Network design
- 11 Constrained optimization problems
- 12 Cut problems
- 13 Iterative relaxation: Early and recent examples
- 14 Summary
- Bibliography
- Index
9 - Matchings
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- Preface
- 1 Introduction
- 2 Preliminaries
- 3 Matching and vertex cover in bipartite graphs
- 4 Spanning trees
- 5 Matroids
- 6 Arborescence and rooted connectivity
- 7 Submodular flows and applications
- 8 Network matrices
- 9 Matchings
- 10 Network design
- 11 Constrained optimization problems
- 12 Cut problems
- 13 Iterative relaxation: Early and recent examples
- 14 Summary
- Bibliography
- Index
Summary
Given a weighted undirected graph, the maximum matching problem is to find a matching with maximum total weight. In his seminal paper, Edmonds [35] described an integral polytope for the matching problem, and the famous Blossom Algorithm for solving the problem in polynomial time.
In this chapter, we will show the integrality of the formulation given by Edmonds [35] using the iterative method. The argument will involve applying uncrossing in an involved manner and hence we provide a detailed proof. Then, using the local ratio method, we will show how to extend the iterative method to obtain approximation algorithms for the hypergraph matching problem, a generalization of the matching problem to hypergraphs.
Graph matching
Matchings in bipartite graphs are considerably simpler than matchings in general graphs; indeed, the linear programming relaxation considered in Chapter 3 for the bipartite matching problem is not integral when applied to general graphs. See Figure 9.1 for a simple example.
Linear programming relaxation
Given an undirected graph G = (V, E) with a weight function w: E → ℛ on the edges, the linear programming relaxation for the maximum matching problem due to Edmonds is given by the following LPM(G). Recall that E(S) denotes the set of edges with both endpoints in S ⊆ V and x(F) is a shorthand for ∑e∈Fxe for F ⊆ E.
Although there are exponentially many inequalities in LPM(G), there is an efficient separation oracle for this linear program, obtained by Padberg and Rao using Gomory-Hu trees.
- Type
- Chapter
- Information
- Iterative Methods in Combinatorial Optimization , pp. 145 - 163Publisher: Cambridge University PressPrint publication year: 2011