An efficient algorithm to solve the conditional covering problem on trapezoid graphs

DOI10.5402/2011/213084zbMATH Open1238.05260OpenAlexW2155274708WikidataQ58689078 ScholiaQ58689078MaRDI QIDQ410643FDOQ410643

Authors Akul Rana, Anita Pal, Madhumangal Pal

Publication date 3 April 2012

Published in ISRN Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2011/213084

zbMATH Keywords

data structure on trapezoid graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Combinatorial aspects of packing and covering (05B40)

Recommendations

• On conditional covering problem
• scientific article; zbMATH DE number 5977185
• On conditional covering problem
• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
• Algorithms for solving the conditional covering problem on paths

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4063148 (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
• Chaining algorithms for multiple genome comparison
• Conditional covering: greedy heuristics and computational results
• Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
• Facility location on a tree with maximum distance constraints
• New heuristics for the conditional covering problem
• On conditional covering problem
• On the 2-Chain Subgraph Cover and Related Problems
• On the structure of trapezoid graphs
• The conditional covering problem on unweighted interval graphs
• Trapezoid graphs and their coloring

Cited in

(6)

• An efficient algorithm to solve connectivity problem on trapezoid graphs
• Efficient algorithm for the vertex connectivity of trapezoid graphs
• scientific article; zbMATH DE number 5977185 (Why is no real title available?)
• An optimal algorithm to solve 2-neighbourhood covering problem on trapezoid graphs
• Efficient algorithms for the conditional covering problem
• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius

This page was built for publication: An efficient algorithm to solve the conditional covering problem on trapezoid graphs

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