The following pages link to Matroid Intersection (Q3205244):
Displaying 50 items.
- Axioms for infinite matroids (Q390757) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Body-and-cad geometric constraint systems (Q448973) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- Independence-domination duality (Q958688) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
- An application of submodular flows (Q1119596) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- Bracing cubic grids - a necessary condition (Q1122584) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- Independence systems with continuous cardinality of bases (Q1149442) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- Applications of combinatorics to statics --- a second survey (Q1201249) (← links)
- An unbounded matroid intersection polyhedron (Q1244236) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Matroids and a forest cover problem (Q1337143) (← links)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- Finding all common bases in two matroids (Q1842654) (← links)
- On some algorithmic investigations of star partitions of graphs (Q1900141) (← links)
- Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Packing of mixed hyperarborescences with flexible roots via matroid intersection (Q2048562) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- The generalized dependency constrained spanning tree problem (Q2132411) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Alternating signed bipartite graphs and difference-1 colourings (Q2197215) (← links)
- On a weighted linear matroid intersection algorithm by deg-det computation (Q2227314) (← links)
- On stability of collaborative supplier selection (Q2294226) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- A weighted independent even factor algorithm (Q2429469) (← links)
- Even factors, jump systems, and discrete convexity (Q2519019) (← links)
- A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
