Random pseudo-polynomial algorithms for exact matroid problems
- 30 June 1992
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 13 (2) , 258-273
- https://doi.org/10.1016/0196-6774(92)90018-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Multi-constrained matroidal knapsack problemsMathematical Programming, 1989
- Intersection of Two Matroids: (Condensed) Border Graphs and RankingSIAM Journal on Discrete Mathematics, 1989
- Matching is as easy as matrix inversionCombinatorica, 1987
- Exact arborescences, matchings and cyclesDiscrete Applied Mathematics, 1987
- Two algorithms for weighted matroid intersectionMathematical Programming, 1986
- Randomized algorithms in combinatorial optimization: A surveyDiscrete Applied Mathematics, 1986
- Unlabelled Partition Systems: Optimization and ComplexitySIAM Journal on Algebraic Discrete Methods, 1984
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947