Generalized Vertex Covering in Interval Graphs

@article{Marathe1992GeneralizedVC,
  title={Generalized Vertex Covering in Interval Graphs},
  author={Madhav V. Marathe and R. Ravi and C. Pandu Rangan},
  journal={Discrete Applied Mathematics},
  year={1992},
  volume={39},
  pages={87-93}
}
Marathe, M.V., R. Ravi and C. Pandu Rangan, Generalized vertex covering in interval graphs. Discrete Applied Mathematics 39 (1992) 87-93. Given an integer i and an undirected graph G. the genera!ized i-verkx OFJPY pr&!z~ is to find a minimum set of vertices such that all chques in G of size i contain at least one vertex from this set. This problem is known… CONTINUE READING