scientific article; zbMATH DE number 3858857
From MaRDI portal
Publication:3328286
combinatorial optimizationdigraphmatchingmatroid intersection problemsoptimum covering of directed cutspolynomial algorithmsubmodular set functionvertex-packing in perfect graphs
Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)
Cited in
(18)- \(K_ i\)-covers. I: Complexity and polytopes
- An integer analogue of Carathéodory's theorem
- Promise problems complete for complexity classes
- Diagonalization, uniformity, and fixed-point theorems
- A taxonomy of complexity classes of functions
- On perfectly two-edge connected graphs
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
- On the number of convex lattice polytopes
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- On the Chvàtal rank of linear relaxations of the stable set polytope
- On co-bicliques
- On the complexity of resilient network design
- On box totally dual integral polyhedra
- Sensitivity theorems in integer linear programming
- Disjoint clique cutsets in graphs without long holes
- Optimal group testing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328286)
