Pages that link to "Item:Q3942972"
From MaRDI portal
The following pages link to A weighted matroid intersection algorithm (Q3942972):
Displayed 50 items.
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- A tour of \(M\)-part \(L\)-Sperner families (Q618322) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- An algorithm for optimum common root functions of two digraphs (Q688253) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- A detachment algorithm for inferring a graph from path frequency (Q1014796) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Persistency and matroid intersection (Q1035281) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Bracing cubic grids - a necessary condition (Q1122584) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890) (← links)
- Applications of combinatorics to statics --- a second survey (Q1201249) (← links)
- The complexity of finding arborescences in hypergraphs (Q1205723) (← links)
- Fenchel-type duality for matroid valuations (Q1290625) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Inverse matroid intersection problem (Q1362679) (← links)
- A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
- Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133) (← links)
- The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
- A multiply constrained matroid optimization problem (Q1825757) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- A dual approximation approach to weighted matroid intersection (Q1919181) (← links)
- Robustness of minimum cost arborescences (Q1926648) (← links)
- Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Matroid bases with cardinality constraints on the intersection (Q2149563) (← links)
- A cost-scaling algorithm for computing the degree of determinants (Q2159472) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- On a weighted linear matroid intersection algorithm by deg-det computation (Q2227314) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Approximation algorithms for the Euclidean bipartite TSP (Q2488237) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- The intersection of a matroid and a simplicial complex (Q3420348) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- Two algorithms for weighted matroid intersection (Q3770280) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- Convexity and Steinitz's exchange property (Q4645928) (← links)
- (Q5005108) (← links)
- Market Pricing for Matroid Rank Valuations (Q5013570) (← links)
- (Q5136271) (← links)
- Pareto Stable Matchings under One-Sided Matroid Constraints (Q5232161) (← links)