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