On Independent Set on B1-EPG Graphs

  • M. BougeretEmail author
  • S. Bessy
  • D. Gonçalves
  • C. Paul
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9499)


In this paper we consider the Maximum Independent Set problem (MIS) on \(B_1\)-EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in  [8] as the class of graphs whose vertices can be represented as simple paths on a rectangular grid so that two vertices are adjacent if and only if the corresponding paths share at least one edge of the underlying grid. The restricted class \(B_k\)-EPG denotes EPG-graphs where every path has at most k bends. The study of MIS on \(B_1\)-EPG graphs has been initiated in [6] where authors prove that MIS is NP-complete on \(B_1\)-EPG graphs, and provide a polynomial 4-approximation. In this article we study the approximability and the fixed parameter tractability of MIS on \(B_1\)-EPG. We show that there is no PTAS for MIS on \(B_1\)-EPG unless P\(=\)NP, even if there is only one shape of path, and even if each path has its vertical part or its horizontal part of length at most 3. This is optimal, as we show that if all paths have their horizontal part bounded by a constant, then MIS admits a PTAS. Finally, we show that MIS is FPT in the standard parameterization on \(B_1\)-EPG restricted to only three shapes of path, and \(W_1\)-hard on \(B_2\)-EPG. The status for general \(B_1\)-EPG (with the four shapes) is left open.


  1. 1.
    Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)zbMATHCrossRefGoogle Scholar
  2. 2.
    Bar-Yehuda, R., Halldórsson, M.M., Naor, J.S., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1–15 (2006)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Bougeret, M., Bessy, S., Gonçalves, D., Paul, C.: On independent set on b1-epg graphs (2015). CoRR arXiv:1510.00598
  4. 4.
    Cameron, K., Chaplick, S., Hoàng, C.T.: Edge intersection graphs of l-shaped paths in grids (2012). CoRR arxiv:1204.5702
  5. 5.
    Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discrete Comput. Geom. 48(2), 373–392 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Epstein, D., Golumbic, M.C., Morgenstern, G.: Approximation algorithms for B \(_\text{1 }\)-EPG graphs. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 328–340. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  7. 7.
    Francis, M.C., Gonçalves, D., Ochem, P.: The maximum clique problem in multiple interval graphs. Algorithmica 71, 1–25 (2013)Google Scholar
  8. 8.
    Golumbic, M.C., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. Netw. 54(3), 130–138 (2009)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Heldt, D., Knauer, K., Ueckerdt, T.: On the bend-number of planar and outerplanar graphs. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 458–469. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  10. 10.
    Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: the bend-number. Discrete Appl. Math. 167, 144–162 (2014)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Jiang, M.: On the parameterized complexity of some optim ization problems related to multiple-interval graphs. Theor. Comput. Sci. 411, 4253–4262 (2010)zbMATHCrossRefGoogle Scholar
  12. 12.
    Kammer, F., Tholey, T.: Approximation algorithms for intersection graphs. Algorithmica 68(2), 312–336 (2014)zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Papadimitriou, C.H.: Computational Complexity. John Wiley and Sons Ltd., Chichester (2003)Google Scholar
  14. 14.
    Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media, Heidelberg (2001)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.LIRMM, CNRSUniversité de MontpellierMontpellierFrance

Personalised recommendations