On a weighted linear matroid intersection algorithm by deg-det computation
DOI10.1007/s13160-020-00413-3zbMath1497.68554arXiv1908.11529OpenAlexW3010060024MaRDI QIDQ2227314
Publication date: 15 February 2021
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.11529
combinatorial optimizationpolynomial-time algorithmweighted matroid intersectiondegree of determinantweight splitting
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (2)
Cites Work
- Constructive non-commutative rank computation is in deterministic polynomial time
- Efficient theoretic and practical algorithms for linear matroid intersection problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Operator scaling: theory and applications
- Exact and approximation algorithms for weighted matroid intersection
- Matroid Intersection
- Algebraic Algorithms for Matching and Matroid Problems
- Improved Bounds for Matroid Partition and Intersection Algorithms
- A weighted matroid intersection algorithm
- Singular spaces of matrices and their application in combinatorics
- Matroid intersection algorithms
- Computing the Degree of Determinants via Combinatorial Relaxation
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- Systems of distinct representatives and linear algebra
- Combinatorial optimization. Theory and algorithms
- Matrices and matroids for systems analysis
This page was built for publication: On a weighted linear matroid intersection algorithm by deg-det computation
