Browse > Article

THE CONDITIONAL COVERING PROBLEM ON UNWEIGHTED INTERVAL GRAPHS  

Rana, Akul (Department of Mathematics, Narajole Raj College)
Pal, Anita (Department of Mathematics, National Institute of Technology)
Pal, Madhumangal (Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University)
Publication Information
Journal of applied mathematics & informatics / v.28, no.1_2, 2010 , pp. 1-11 More about this Journal
Abstract
The conditional covering problem is an important variation of well studied set covering problem. In the set covering problem, the problem is to find a minimum cardinality vertex set which will cover all the given demand points. The conditional covering problem asks to find a minimum cardinality vertex set that will cover not only the given demand points but also one another. This problem is NP-complete for general graphs. In this paper, we present an efficient algorithm to solve the conditional covering problem on interval graphs with n vertices which runs in O(n)time.
Keywords
large solutions; blow-up rate; uniqueness; sub-supersolutions;
Citations & Related Records
연도 인용수 순위
  • Reference
1 I.D. Moon, L. Papayanopoulos, Facility location on a tree with maximum distance constraints, Comput. Oper. Res., 22 (1995), 905-914.   DOI   ScienceOn
2 M. Pal, G.P. Bhattacharjee, A data structure on interval graphs and its applications, J. Circuits, Systems and Computers, 7(3) (1997), 165-175.   DOI   ScienceOn
3 S. Mondal, M. Pal, T.K. Pal, An optimal algorithm to solve 2-neighbourhood covering problem on interval graphs, Intern. J. computer Math., 79 (2002), 189-204.   DOI   ScienceOn
4 I.D. Moon, Conditional covering: worst case analysis of greedy heuristics, J. Korean OR/MS Society, 15 (1990), 97-104.
5 J.A. Horne, J.C. 8mith, Dynamic programming algorithm for the conditional covering problem on path and extended star graph, Networks, 46(4) (2005),177-185.   DOI   ScienceOn
6 V. Lotfi, I. D: Moon, Hybrid heuristics conditional covering problem, Int. J. Modeling Simulation, 17 (1997),185-190.
7 B.J. Lunday, J.C. Smith, J.B. Goldberg, AIgorithms for solving the conditional covering problem on paths, Naval Res. Logistics, 52 (2005), 293-301.   DOI   ScienceOn
8 J.A. Horne, J.C. Smith, A Dynamic programming algorithm for the conditional covering problem on tree graphs, Networks, 46(4) (2005), 186-197.   DOI   ScienceOn
9 J.M.Keil, Total domination in interval graphs, Information Processing Letters, 22 (1986), 171-174.   DOI   ScienceOn
10 S.M. Hedetniemi, E.J. Cockayne, S.T. Hedetniemi, Linear algorithm for finding the Jordan centre and path centre of a tree, Transport Sci., 98 (1981) , 98-114.
11 I.D. Moon, S.S. Chaudhry, An analysis of network location problems with distance constraints, Management Sci., 30 (1984), 290-307.   DOI   ScienceOn
12 S.S. Chaudhry, I.D. Moon, S.T. McCormick, Conditional covering: Greedy heuristics and computational results, Comput. Oper. Res.,14 (1987),11-18.   DOI   ScienceOn
13 E.J. Cockayne, R.M. Dawes, S.T. Hedetniemi, Total domination in graphs, Networks, 11(1980) , 211-219.
14 M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
15 S.S. Chaudhry, New heuristics for the conditional covering problem, Opsearch, 30 (1993), 42-47.
16 M. Pal, G.P. Bhattacharjee, Optimal sequential and parallel algorithms for computing the diameter and center of an interval graph, Intern. J. Computer Math., 59 (1995), 1-13.   DOI   ScienceOn
17 M. Pal, G.P. Bhattacharjee, The parallel algorithms for determining edge packing and efficient edge dominating set in interval graphs, Parallel Algorithms and Applications, 7(1995), 193-207.   DOI   ScienceOn
18 G. Ramalingam, C. Pandu Rangan, A unified approach to domination problems in intervalgraphs, Information Processing Letters, 27 (1988), 271-274.   DOI   ScienceOn