On conditional covering problem

DOI10.1007/s11786-009-0001-1zbMath1205.05229OpenAlexW2003522749MaRDI QIDQ626967

Balasubramanian Sivan, C. Pandu Rangan, Sri Harini

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-009-0001-1

zbMATH Keywords

pathsfacility locationinterval graphsconditional covering problemtotal domination problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

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

Cites Work

• Unnamed Item
• Conditional covering: greedy heuristics and computational results
• Facility location on a tree with maximum distance constraints
• Domination and total domination on asteroidal triple-free graphs
• An Analysis of Network Location Problems with Distance Constraints
• Algorithms for solving the conditional covering problem on paths
• Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
• A dynamic programming algorithm for the conditional covering problem on tree graphs

This page was built for publication: On conditional covering problem