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