共 50 条
- [1] A DYNAMIC-PROGRAMMING ALGORITHM FOR COVERING PROBLEMS WITH (GREEDY) TOTALLY BALANCED CONSTRAINT MATRICES [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (03): : 348 - 357
- [2] CHARACTERIZATIONS OF TOTALLY BALANCED MATRICES [J]. JOURNAL OF ALGORITHMS, 1984, 5 (02) : 215 - 230
- [3] Probe matrix problems: Totally balanced matrices [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 368 - +
- [5] Totally greedy coin sets and greedy obstructions [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
- [9] On Greedy and Submodular Matrices [J]. THEORY AND PRACTICE OF ALGORITHMS IN COMPUTER SYSTEMS, 2011, 6595 : 116 - +