On conditional covering problem

DOI10.1007/S11786-009-0001-1MaRDI QIDQ626967zbMATH OpenOpenAlexFDO

Authors 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

conditional covering problemfacility locationinterval graphspathstotal domination problem

Mathematics Subject Classification ID

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

Recommendations

• On conditional covering problem
• The Maximal Conditional Covering Problem
• Publication:3487357
• scientific article; zbMATH DE number 9246
• Covering Problems
• Covering Problems
• scientific article; zbMATH DE number 482640
• Efficient algorithms for the conditional covering problem
• The covering problem

Cites work

• A dynamic programming algorithm for the conditional covering problem on tree graphs
• Algorithms for solving the conditional covering problem on paths
• An Analysis of Network Location Problems with Distance Constraints
• Conditional covering: greedy heuristics and computational results
• Domination and total domination on asteroidal triple-free graphs
• Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
• Facility location on a tree with maximum distance constraints
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)

Cited in

(11)

• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
• scientific article; zbMATH DE number 5977185 (Why is no real title available?)
• On conditional covering problem
• The conditional covering problem on unweighted interval graphs
• scientific article; zbMATH DE number 4150221 (Why is no real title available?)
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs
• Algorithms for solving the conditional covering problem on paths
• The Maximal Conditional Covering Problem
• 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
• Efficient algorithms for the conditional covering problem

This page was built for publication: On conditional covering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626967)