Approximating Minimum Dominating Set on String Graphs

09/26/2018
by   Dibyayan Chakraborty, et al.
0

In this paper, we give approximation algorithms for the Minimum Dominating Set (MDS) problem on string graphs and its subclasses. A path is a simple curve made up of alternating horizontal and vertical line segments. A k-bend path is a path made up of at most k + 1 line segments. An L-path is a 1-bend path having the shape `L'. A vertically-stabbed-L graph is an intersection graph of L-paths intersecting a common vertical line. We give 8-approximation algorithm for MDS problem on vertically-stabbed-L graphs whose APX-hardness was shown by Bandyapadhyay et al. (MFCS, 2018). To prove the above result, we needed to study the Stabbing segments with rays (SSR) problem introduced by Katz et al. (Comput. Geom. 2005). In the SSR problem, the input is a set of (disjoint) leftward-directed rays, and a set of (disjoint) vertical segments. The objective is to select a minimum number of rays that intersect all vertical segments. We give a O((n+m) (n+m))-time 2-approximation algorithm for the SSR problem where n and m are the number of rays and segments in the input. A unit k-bend path is a k-bend path whose segments are of unit length. A graph is a unit B_k-VPG graph if it is an intersection graph of unit k-bend paths. Any string graph is a unit-B_k-VPG graph for some finite k. Using our result on SSR-problem, we give a polynomial time O(k^4)-approximation algorithm for MDS problem on unit B_k-VPG graphs for k≥ 0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2017

A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid

A graph G is called B_k-VPG, for some constant k≥ 0, if it has a string ...
research
03/16/2018

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames

We consider the Minimum Dominating Set (MDS) problem on the intersection...
research
04/18/2018

On bounds on bend number of split and cocomparability graphs

A path is a simple, piecewise linear curve made up of alternating horizo...
research
09/03/2021

Retraction: Improved Approximation Schemes for Dominating Set Problems in Unit Disk Graphs

Retraction note: After posting the manuscript on arXiv, we were informed...
research
08/18/2017

Non-crossing paths with geographic constraints

A geographic network is a graph whose vertices are restricted to lie in ...
research
03/17/2019

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives

A graph G with n vertices is called an outerstring graph if it has an in...
research
12/02/2022

Stabbing balls with line segments and polygonal paths

We study the problem of ordered stabbing of n balls (of arbitrary and po...

Please sign up or login with your details

Forgot password? Click here to reset