An algebraic algorithm for weighted linear matroid intersection

MaRDI QIDQ2934625zbMATH OpenFDO

Authors Nicholas J. A. Harvey

Publication date 18 December 2014

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Efficient theoretic and practical algorithms for linear matroid intersection problems
• Exact and approximation algorithms for weighted matroid intersection
• On a weighted linear matroid intersection algorithm by deg-det computation
• Exact and approximation algorithms for weighted matroid intersection
• Two algorithms for weighted matroid intersection

Cited in

(13)

• Efficient theoretic and practical algorithms for linear matroid intersection problems
• A dual approximation approach to weighted matroid intersection
• On a weighted linear matroid intersection algorithm by deg-det computation
• Exact and approximation algorithms for weighted matroid intersection
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Algebraic algorithms for linear matroid parity problems
• Algebraic algorithms for matching and matroid problems
• scientific article; zbMATH DE number 11347 (Why is no real title available?)
• Exact and approximation algorithms for weighted matroid intersection
• A Fast Approximation for Maximum Weight Matroid Intersection
• Fast greedy for linear matroids
• A deterministic parallel reduction from weighted matroid intersection search to decision
• A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors

This page was built for publication: An algebraic algorithm for weighted linear matroid intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934625)