Dynamic programming algorithms for the conditional covering problem on path and extended star graphs

DOI10.1002/net.20086zbMath1093.90072MaRDI QIDQ5717712

J. Cole Smith, Jennifer A. Horne

Publication date: 10 January 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20086

zbMATH Keywords

dynamic programming; facility location; total domination; conditional covering problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90C39: Dynamic programming

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

90B80: Discrete location and assignment

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

An efficient algorithm to solve the conditional covering problem on trapezoid graphs, On conditional covering problem, Efficient algorithms for the conditional covering problem, The conditional covering problem on unweighted interval graphs with nonuniform coverage radius