The conditional covering problem on unweighted interval graphs

MaRDI QIDQ3171770zbMATH OpenFDO

Authors Akul Rana, Anita Pal, Madhumangal Pal

Publication date 5 October 2011

zbMATH Keywords

blow-up ratelarge solutionssub-supersolutionsuniqueness

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
• scientific article; zbMATH DE number 5977185
• Efficient algorithms for the conditional covering problem
• On conditional covering problem
• Generalized vertex covering in interval graphs

Cited in

(11)

• Generalized vertex covering in interval graphs
• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
• Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
• On interval and circular-arc covering problems
• Demand hitting and covering of intervals
• On the graph condition regarding the F-inverse cover problem
• scientific article; zbMATH DE number 5977185 (Why is no real title available?)
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs
• Using an interval graph approach to efficiently solve the housing benefit data retrieval problem
• scientific article; zbMATH DE number 4197287 (Why is no real title available?)
• Efficient algorithms for the conditional covering problem

This page was built for publication: The conditional covering problem on unweighted interval graphs

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