Efficient algorithms for the conditional covering problem
From MaRDI portal
Publication:690494
DOI10.1016/J.IC.2012.08.003zbMATH Open1280.90129OpenAlexW2085731892MaRDI QIDQ690494FDOQ690494
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
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
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Discrete location and assignment (90B80)
Cites Work
- On the Algorithmic Complexity of Total Domination
- Total domination in graphs
- Title not available (Why is that?)
- The Location of Emergency Service Facilities
- Title not available (Why is that?)
- The conditional covering problem on unweighted interval graphs
- An Analysis of Network Location Problems with Distance Constraints
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Facility location on a tree with maximum distance constraints
- Conditional covering: greedy heuristics and computational results
- New heuristics for the conditional covering problem
- 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
- On conditional covering problem
- Title not available (Why is that?)
- Total Domination and Irredundance in Weighted Interval Graphs
Cited In (11)
- 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
- On conditional covering problem
- 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
- Conditional covering: greedy heuristics and computational results
- New heuristics for the conditional covering problem
- On conditional covering problem
- The conditional covering problem on unweighted interval graphs
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
- Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks
- Algorithms for solving the conditional covering problem on paths
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)
