Abstract
In a previous article, we presented algorithms for solving the Conditional Covering Problem (CCP) on path and extended star graphs. The CCP on these graphs can be solved in O(n 2) time, where n is the number of nodes in the graph. In this article, we propose a new dynamic programming procedure to solve the CCP on tree graphs. This recursion works from the leaf nodes of the tree up to the root node, using notions of protected and unprotected costs as done for the CCP path algorithm in our previous work. We introduce new preliminary routines and data structures to merge information from subpaths and subtrees, resulting in an O(n 4) algorithm to optimally solve the problem.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 186-197 |
| Number of pages | 12 |
| Journal | Networks |
| Volume | 46 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 2005 |
| Externally published | Yes |
Keywords
- Conditional covering problem
- Facility location; dynamic programming
- Total domination
- Tree graphs
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications