ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A constant factor approximation algorithm for boxicity of circular arc graphs

Adiga, Abhijin and Babu, Jasine and Chandran, Sunil L (2014) A constant factor approximation algorithm for boxicity of circular arc graphs. In: DISCRETE APPLIED MATHEMATICS, 178 . pp. 1-18.

[img] PDF
dis_app_mat_178-1_2014.pdf - Published Version
Restricted to Registered users only

Download (560kB) | Request a copy
Official URL: http://dx.doi.org/ 10.1016/j.dam.2014.06.013


The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Keywords: Boxicity; Cubicity; Circular arc graphs; Approximation algorithm; Normal circular arc graphs
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 28 Nov 2014 04:31
Last Modified: 28 Nov 2014 04:31
URI: http://eprints.iisc.ac.in/id/eprint/50320

Actions (login required)

View Item View Item