An O(mn) algorithm for regular set-covering problems
- 31 October 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 54 (2-3) , 237-247
- https://doi.org/10.1016/0304-3975(87)90131-9
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Polynomial-time algorithms for regular set-covering and threshold synthesisDiscrete Applied Mathematics, 1985
- An Algorithm to Dualize a Regular Switching FunctionIEEE Transactions on Computers, 1979
- The matroids with the max-flow min-cut propertyJournal of Combinatorial Theory, Series B, 1977