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