Efficient algorithms for the conditional covering problem

DOI10.1016/j.ic.2012.08.003zbMath1280.90129OpenAlexW2085731892MaRDI QIDQ690494

Yuzhuang Hu, Biing-Feng Wang, Qiaosheng Shi, Chien-Hsin Lin, Robert Benkoczi, Binay K. Bhattacharya

Publication date: 27 November 2012

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.08.003

zbMATH Keywords

algorithmsdynamic programminggraphsconditional coveringcovering location problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On conditional covering problem
• Conditional covering: greedy heuristics and computational results
• Facility location on a tree with maximum distance constraints
• New heuristics for the conditional covering problem
• An Analysis of Network Location Problems with Distance Constraints
• On the Algorithmic Complexity of Total Domination
• Total Domination and Irredundance in Weighted Interval Graphs
• Total domination in graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Algorithms for solving the conditional covering problem on paths
• The Location of Emergency Service Facilities
• 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: Efficient algorithms for the conditional covering problem