scientific article

zbMATH Open1236.05197MaRDI QIDQ3100107

Anitą Pal, Madhumangal Pal, Akul Rana

Publication date: 22 November 2011

Title of this publication is not available (Why is that?)

zbMATH Keywords

analysis of algorithmsdesign of algorithmsset coveringinterval graphconditional covering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs 👍 👎
• On conditional covering problem 👍 👎
• Conditional covering: greedy heuristics and computational results 👍 👎
• Covering problems in edge- and node-weighted graphs 👍 👎
• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius 👍 👎
• The Steiner cycle and path cover problem on interval graphs 👍 👎
• Algorithms for solving the conditional covering problem on paths 👍 👎
• Thek-neighbourhood-covering problem on interval graphs 👍 👎

This page was built for publication:

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