The conditional covering problem on unweighted interval graphs with nonuniform coverage radius

DOI10.1007/S11786-011-0106-1zbMATH Open1262.05146OpenAlexW2066932310MaRDI QIDQ1948610FDOQ1948610

Authors: Akul Rana, Anita Pal, Madhumangal Pal 

Publication date: 24 April 2013

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-011-0106-1

Recommendations

• The conditional covering problem on unweighted interval graphs
• scientific article; zbMATH DE number 5977185
• On conditional covering problem
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs
• Efficient algorithms for the conditional covering problem

zbMATH Keywords

distanceanalysis of algorithmsinterval graphdesign of algorithmsmaximal cliqueconditional covering problemminimum cardinality vertex set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• The conditional covering problem on unweighted interval graphs
• An Analysis of Network Location Problems with Distance Constraints
• Title not available (Why is that?)
• 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

Cited In (7)

• Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• A linear time algorithm to compute square of interval graphs and their colouring
• \(L(2,1)\)-labeling of interval graphs
• Title not available (Why is that?)
• The conditional covering problem on unweighted interval graphs

This page was built for publication: The conditional covering problem on unweighted interval graphs with nonuniform coverage radius

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