Journal Article

A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices

  • Broin M
  • Lowe T
SIAM Journal on Algebraic Discrete Methods (1986) 7(3) 348-357
DOI: 10.1137/0607039
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Broin, M. W., & Lowe, T. J. (1986). A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices. SIAM Journal on Algebraic Discrete Methods, 7(3), 348–357. https://doi.org/10.1137/0607039

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free