Efficient algorithms for the conditional covering problem

DOI10.1016/J.IC.2012.08.003MaRDI QIDQ690494zbMATH OpenOpenAlexFDO

Authors Robert Benkoczi, Yuzhuang Hu, Chien-Hsin Lin, Qiaosheng Shi, Biing-Feng Wang, Binay 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

algorithmsgraphsdynamic programmingconditional coveringcovering location problems

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for solving the conditional covering problem on paths
• Conditional covering: greedy heuristics and computational results
• New heuristics for the conditional covering problem
• Implementation algorithms for solution of covering problems and analysis of their efficiency
• Approximation algorithms for partial covering problems
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs
• An approximation algorithm for the total covering problem
• Efficient solution methods for covering tree problems
• On conditional covering problem
• On conditional covering problem

Cites work

• scientific article; zbMATH DE number 3910441 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1253041 (Why is no real title available?)
• 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
• Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Facility location on a tree with maximum distance constraints
• New heuristics for the conditional covering problem
• On conditional covering problem
• On the Algorithmic Complexity of Total Domination
• The Location of Emergency Service Facilities
• The conditional covering problem on unweighted interval graphs
• Total Domination and Irredundance in Weighted Interval Graphs
• Total domination in graphs

Cited in

(12)

• Algorithms for solving the conditional covering problem on paths
• Conditional covering: greedy heuristics and computational results
• On conditional covering problem
• New heuristics for the conditional covering problem
• Covering edges in networks
• Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks
• The conditional covering problem on unweighted interval graphs
• An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
• On conditional covering problem
• A dynamic programming algorithm for the conditional covering problem on tree graphs
• Dynamic programming algorithms for the conditional covering problem on path and extended star graphs

This page was built for publication: Efficient algorithms for the conditional covering problem

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