Persistency in combinatorial optimization problems on matroids
From MaRDI portal
Publication:5936456
DOI10.1016/S0166-218X(00)00279-1zbMath0986.05026MaRDI QIDQ5936456
Katarína Cechlárova, Vladimír Lacko
Publication date: 3 June 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Safety and completeness in flow decompositions for RNA assembly ⋮ Tropical Kirchhoff's formula and postoptimality in matroid optimization ⋮ Persistency in combinatorial optimization problems on matroids ⋮ Persistency and matroid intersection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching theory
- Matroid theory and its applications in electric network theory and in statics
- Persistency in the assignment and transportation problems
- Persistency in maximum cardinality bipartite matchings
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Matroid intersection algorithms
- On Representatives of Subsets
- Optimal assignments in an ordered set: An application of matroid theory
- Matroids and the greedy algorithm
- Persistency in combinatorial optimization problems on matroids
This page was built for publication: Persistency in combinatorial optimization problems on matroids
