scientific article; zbMATH DE number 3858856
From MaRDI portal
Publication:3328285
zbMATH Open0539.90077MaRDI QIDQ3328285FDOQ3328285
Authors: Bernhard Korte
Publication date: 1982
Title of this publication is not available (Why is that?)
Recommendations
surveycomputational complexitycombinatorial optimizationmatroidsindependence systemspolynomialityoracle techniques
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (18)
- Matroids and combinatorial optimisation
- Matroidizing set systems: A new approach to matroid theory
- Matroids you have known
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs
- Title not available (Why is that?)
- Pseudomatroids
- A characterization of matroidal systems of inequalities
- Matrices and matroids for systems analysis
- A constrained independent set problem for matroids
- Ordered matroids and regular independence systems
- Minimum partition of an independence system into independent sets
- Independence and port oracles for matroids, with an application to computational learning theory
- On the geometric structure of independence systems
- An ordered independence system and its applications to scheduling problems
- Title not available (Why is that?)
- Recent trends in combinatorial optimization
- Bimatroidal independence systems
- A note on independence systems and matroids
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 Q3328285)