Report of the Session on Algorithms for Special Classes of Combinatorial Optimization Problems
DOI10.1016/S0167-5060(08)70833-1zbMath0412.68035MaRDI QIDQ4199521
Uri N. Peled, Jan Karel Lenstra
Publication date: 1979
Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)
partition; combinatorial optimization; polynomial-time algorithm; matroid; parity; matching problems; graphical algorithms; maximum independent set problems
68Q25: Analysis of algorithms and problem complexity
05A17: Combinatorial aspects of partitions of integers
05B35: Combinatorial aspects of matroids and geometric lattices
05A99: Enumerative combinatorics
05C99: Graph theory
05B99: Designs and configurations
Related Items