A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
DOI10.1137/0607039zbMATH Open0594.90062OpenAlexW2053658161MaRDI QIDQ3725872FDOQ3725872
Authors: Martin W. Broin, Timothy J. Lowe 
Publication date: 1986
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0607039
Recommendations
Dynamic programming (90C39) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Inventory, storage, reservoirs (90B05)
Cites Work
- Title not available (Why is that?)
- The Maximum Coverage Location Problem
- Totally-Balanced and Greedy Matrices
- Title not available (Why is that?)
- The distance-domination numbers of trees
- Balanced matrices
- Solving covering problems and the uncapacitated plant location problem on trees
- A general algorithm for the optimal distribution of effort
- A Class of Balanced Matrices Arising from Location Problems
- Title not available (Why is that?)
Cited In (7)
- Totally-Balanced and Greedy Matrices
- Characterising \((k,\ell )\)-leaf powers
- Totally balanced and totally unimodular matrices defined by center location problems
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Worst-case incremental analysis for a class ofp-facility location problems
- Improved complexity bounds for location problems on the real line
- Neighborhood subtree tolerance graphs
This page was built for publication: A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725872)
