An efficient algorithm to solve the conditional covering problem on trapezoid graphs
From MaRDI portal
Publication:410643
DOI10.5402/2011/213084zbMath1238.05260WikidataQ58689078 ScholiaQ58689078MaRDI QIDQ410643
Madhumangal Pal, Anita Pal, Akul Rana
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
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
05B40: Combinatorial aspects of packing and covering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On conditional covering problem
- Conditional covering: greedy heuristics and computational results
- Trapezoid graphs and their coloring
- On the structure of trapezoid graphs
- Facility location on a tree with maximum distance constraints
- New heuristics for the conditional covering problem
- Chaining algorithms for multiple genome comparison
- An Analysis of Network Location Problems with Distance Constraints
- On the 2-Chain Subgraph Cover and Related Problems
- 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