Introductory courses in combinatorial optimization are popular at the upper undergraduate/
graduate levels in computer science, industrial engineering, and business management/OR …

Self-reducibility is the backbone of each greedy algorithm in which self-reducibility structure
is a tree of special kind, ie, its internal nodes lie on a path. In this chapter, we study …

Optimization has continued to expand in all directions at an astonishing rate. New
algorithmic and theoretical techniques are continually developing and the diffusion into …

Regular matroids are binary matroids with no minors isomorphic to the Fano matroid $ F_7 $
or its dual $ F_7^* $. Seymour proved that 3-connected regular matroids are either graphs …

Oid is an interactive extensible software system for studying matroids. Since matroids are a
generalization of many other combinatorial objects such as graphs, matrices and linear …

Rayleigh matroids are a class of matroids with sets of bases that satisfy a strong negative
correlation property. Interesting characteristics include the existence of an efficient algorithm …

マトロイドは, ベクトル空間における線形独立性を抽象化したある性質を満たす有限集合とその部分
集合族の組であり, Whitney [1] と Nakasawa [2] によってそれぞれ独立に導入された …