A fast, simpler algorithm for the matroid parity problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5035 LNCS, Issue , 2008, Pages 240-258

  Orlin, James B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Matroid intersection; Matroid matching; Matroid parity; Nonbipartite matching

Indexed keywords

HEIDELBERG (CO); INTERNATIONAL CONFERENCES; MATCHINGS; MATROID; MATROID INTERSECTION; PARITY PROBLEMS; RUNNING TIME; SIMPLER ALGORITHMS; SPRINGER (CO);

AEROSPACE APPLICATIONS; ALGORITHMS; BOOLEAN FUNCTIONS; CHEMICAL MODIFICATION; COLUMNS (STRUCTURAL); COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; EIGENVALUES AND EIGENFUNCTIONS; EVOLUTIONARY ALGORITHMS; INTERSECTIONS; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; NUMERICAL METHODS; OPTIMIZATION; SCHEDULING ALGORITHMS;

INTEGER PROGRAMMING;

EID: 45749121174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_17     Document Type: Conference Paper

References (12)

1. Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics 17, 449-467 (1965)
2. Edmonds, J.: Submodular functions, matroids, and certain polyhedral. In: Guy, R., Hanani, H., Sauer, N., Schónheim, J. (eds.) Combinatorial Structures and Their Applications (proceedings Calgary International Conference on Combinatorial Structures and Their Applications, Calgary, Alberta, 1969), pp. 69-87. Gordon and Breach, New York (1970)
3. Gabow, H.N., Stallmann, M.: An augmenting path algorithm for linear matroid parity. Combinatorica 6, 123-150 (1986)
4. Jensen, P.M., Korte, B.: Complexity of matroid property algorithms. SIAM Journal on Computing 11, 184-190 (1982)
5. Lawler, E.L.: Optimal matroid intersections. In: Guy, R., Hanani, H., Sauer, N., Schónheim, J. (eds.) Combinatorial Structures and Their Applications (proceedings Calgary International Conference on Combinatorial Structures and Their Applications, Calgary, Alberta, 1969), pp. 233-234. Gordon and Breach, New York (1970)
6. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Hold, Rinehart and Winston, New York (1976)
7. Lovász, L.: Matroid matching and some applications. Journal of Combinatorial Theory Series B 28, 208-236 (1980)
8. Lovász, L.: The matroid matching problem. In: Lovász, L., Sós, V.T. (eds.) Algebraic Methods in Graph Theory, Vol. II (Colloquium Szeged, 1978). Colloquia, Mathematica Societatis János Bolyai, vol. 25, pp. 495-517. North-Holland, Amsterdam (1981)
9. Lovász, L., Plummer, M.D.: Matching Theory. Akadémiai Kiadó, Budapest (1986) (also North-Holland Mathematics Studies vol. 121. North-Holland, Amsterdam)
10. Orlin, J.B., Vande Vate, J.H.: Solving the matroid parity problem as a sequence of matroid intersection problems. Mathematical Programming 47, 81-106 (1990)
11. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 2. Springer, New York (2003)
12. Stallmann, M., Gabow, H.N.: An augmenting path algorithm for the parity problem on linear matroids. In: 25th Annual Symposium on Foundations of Computer Science, New York, pp. 217-227. IEEE, Los Alamitos (1984)