Two algorithms for weighted matroid intersection
From MaRDI portal
Recommendations
- Efficient theoretic and practical algorithms for linear matroid intersection problems
- scientific article; zbMATH DE number 4068895
- Exact and approximation algorithms for weighted matroid intersection
- A Fast Approximation for Maximum Weight Matroid Intersection
- Exact and approximation algorithms for weighted matroid intersection
Cites work
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
- A weighted matroid intersection algorithm
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Matroid Intersection
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
Cited in
(38)- A new algorithm for the intersection of a line with the independent set polytope of a matroid
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- Color constrained combinatorial optimization problems
- Crashing a maximum-weight complementary basis
- Paroids: A canonical format for combinatorial optimization
- A bound for the symmetric travelling salesman problem through matroid formulation
- Paroid search: Generic local combinatorial optimization
- Efficient theoretic and practical algorithms for linear matroid intersection problems
- A dual approximation approach to weighted matroid intersection
- The \(b\)-branching problem in digraphs
- Exact and approximation algorithms for weighted matroid intersection
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion
- An algebraic algorithm for weighted linear matroid intersection
- Some results on the weights of -structures
- scientific article; zbMATH DE number 3904606 (Why is no real title available?)
- A time expanded matroid algorithm for finding optimal dynamic matroid intersections
- Improved Bounds for Matroid Partition and Intersection Algorithms
- scientific article; zbMATH DE number 123444 (Why is no real title available?)
- The minimum spanning tree problem with conflict constraints and its variations
- scientific article; zbMATH DE number 1953191 (Why is no real title available?)
- scientific article; zbMATH DE number 1555984 (Why is no real title available?)
- Exact and approximation algorithms for weighted matroid intersection
- A Fast Approximation for Maximum Weight Matroid Intersection
- Valuated Matroid Intersection II: Algorithms
- scientific article; zbMATH DE number 1839479 (Why is no real title available?)
- On the generality of the greedy algorithm for solving matroid base problems
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- On finding optimal polytrees
- Parallel algorithms for matroid intersection and matroid parity
- Multi-objective matroid optimization with ordinal weights
- Matroid Intersection under Restricted Oracles
- Adaptive sparsification for matroid intersection
- Problems on group-labeled matroid bases
- Finding spanning trees with perfect matchings
- How to allocate review tasks for robust ranking
- Optimization of the directed spanning trees using the weighted matroid intersection algorithm
- The convex weighting of a graph and an alternative definition of a matroid
This page was built for publication: Two algorithms for weighted matroid intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770280)
