A weighted matroid intersection algorithm
From MaRDI portal
Cited in
(67)- A detachment algorithm for inferring a graph from path frequency
- Rooted \(k\)-connections in digraphs
- Persistency and matroid intersection
- A note on submodular set cover on matroids
- Generalized polymatroids and submodular flows
- Bracing cubic grids - a necessary condition
- Crashing a maximum-weight complementary basis
- Steiner trees with n terminals among n+1 nodes
- Applications of combinatorics to statics --- a second survey
- The complexity of finding arborescences in hypergraphs
- Fenchel-type duality for matroid valuations
- Discrete convex analysis
- Inverse matroid intersection problem
- A bound for the symmetric travelling salesman problem through matroid formulation
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- The base-matroid and inverse combinatorial optimization problems.
- A multiply constrained matroid optimization problem
- Minimum k arborescences with bandwidth constraints
- A dual approximation approach to weighted matroid intersection
- Robustness of minimum cost arborescences
- Shortest bibranchings and valuated matroid intersection
- Optimal matroid partitioning problems
- Matroid bases with cardinality constraints on the intersection
- A cost-scaling algorithm for computing the degree of determinants
- The \(b\)-branching problem in digraphs
- On a weighted linear matroid intersection algorithm by deg-det computation
- Exact and approximation algorithms for weighted matroid intersection
- Approximate tradeoffs on weighted labeled matroids
- Matroid representation of clique complexes
- Approximation algorithms for the Euclidean bipartite TSP
- Recent developments in discrete convex analysis
- Algorithms for the partial inverse matroid problem in which weights can only be increased
- The intersection of a matroid and a simplicial complex
- The popular matching and condensation problems under matroid constraints
- Covering Directed Graphs by In-Trees
- Two algorithms for weighted matroid intersection
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Convexity and Steinitz's exchange property
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- On finding optimal polytrees
- Market pricing for matroid rank valuations
- Optimal matroid partitioning problems
- Pareto stable matchings under one-sided matroid constraints
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- Popular matchings with ties and matroid constraints
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- Multi-objective matroid optimization with ordinal weights
- scientific article; zbMATH DE number 7765397 (Why is no real title available?)
- A deterministic parallel reduction from weighted matroid intersection search to decision
- On Fair Division under Heterogeneous Matroid Constraints
- Matroid Intersection under Restricted Oracles
- A tour of \(M\)-part \(L\)-Sperner families
- Diverse collections in matroids and graphs
- Covering directed graphs by in-trees
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Poset matching---a distributive analog of independent matching
- Adaptive sparsification for matroid intersection
- Problems on group-labeled matroid bases
- An algorithm for optimum common root functions of two digraphs
- Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
- Popular arborescences and their matroid generalization
- Finding a minimum spanning tree with a small non-terminal set
- Diverse collections in matroids and graphs
- Optimization of the directed spanning trees using the weighted matroid intersection algorithm
- A formal analysis of algorithms for matroids and greedoids
- Finding feasible vectors of Edmonds-Giles polyhedra
This page was built for publication: A weighted matroid intersection algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942972)
