DeepAI AI Chat
Log In Sign Up

Approximating MIS over equilateral B_1-VPG graphs

by   Abhiruk Lahiri, et al.
The Institute of Mathematical Sciences, Chennai

We present an approximation algorithm for the maximum independent set (MIS) problem over the class of equilateral B_1-VPG graphs. These are intersection graphs of L-shaped planar objects 90^o) with both arms of each object being equal. We obtain a 36(log 2d)-approximate algorithm running in O(n(log n)^2) time for this problem, where d is the ratio d_max/d_min and d_max and d_min denote respectively the maximum and minimum length of any arm in the input equilateral L-representation of the graph. In particular, we obtain O(1)-factor approximation of MIS for B_1-VPG -graphs for which the ratio d is bounded by a constant. generalized to an O(n(log n)^2) time and a 36(log 2d_x)(log 2d_y)-approximate MIS algorithm over arbitrary B_1-VPG graphs. Here, d_x and d_y denote respectively the analogues of d when restricted to only horizontal and vertical arms of members of the input. This is an improvement over the previously best n^ϵ-approximate algorithm <cit.> (for some fixed ϵ>0), unless the ratio d is exponentially large in n. In particular, O(1)-approximation of MIS is achieved for graphs with max{d_x,d_y}=O(1).


page 1

page 2

page 3

page 4


An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

In this paper, we consider the task of computing an independent set of m...

Approximation in (Poly-) Logarithmic Space

We develop new approximation algorithms for classical graph and set prob...

Approximating the (continuous) Fréchet distance

We describe the first strongly subquadratic time algorithm with subexpon...

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles

Independent set is a fundamental problem in combinatorial optimization. ...

Approximating TSP walks in subcubic graphs

We prove that every simple 2-connected subcubic graph on n vertices with...

Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs

We present the first work-optimal polylogarithmic-depth parallel algorit...

Approximating the Percolation Centrality through Sampling and Pseudo-dimension

In this work we investigate the problem of percolation centrality, a gen...