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

DOI10.1002/net.20086zbMath1093.90072OpenAlexW4232079993MaRDI 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 programmingfacility locationtotal dominationconditional covering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

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

This page was built for publication: Dynamic programming algorithms for the conditional covering problem on path and extended star graphs