scientific article
From MaRDI portal
Publication:3328286
zbMath0539.90078MaRDI QIDQ3328286
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
digraphcombinatorial optimizationmatchingpolynomial algorithmsubmodular set functionmatroid intersection problemsoptimum covering of directed cutsvertex-packing in perfect graphs
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)
Related Items (17)
A taxonomy of complexity classes of functions ⋮ Optimal group testing ⋮ On the number of convex lattice polytopes ⋮ On box totally dual integral polyhedra ⋮ On perfectly two-edge connected graphs ⋮ Promise problems complete for complexity classes ⋮ Sensitivity theorems in integer linear programming ⋮ The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. ⋮ On the Chvátal rank of linear relaxations of the stable set polytope ⋮ On co-bicliques ⋮ Diagonalization, uniformity, and fixed-point theorems ⋮ Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems ⋮ Disjoint clique cutsets in graphs without long holes ⋮ On the complexity of resilient network design ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope ⋮ \(K_ i\)-covers. I: Complexity and polytopes ⋮ An integer analogue of Carathéodory's theorem
This page was built for publication:
