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 (2011) A constant factor approximation algorithm for boxicity of circular arc graphs. In: WADS'11 Proceedings of the 12th International Conference on Algorithms and Data Structures, 2011, Heidelberg.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-22300-6_2

Abstract

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.

Item Type: Conference Paper
Related URLs:
Additional Information: Copyright of this article belongs to Springer-Verlag Berlin.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 19 Mar 2013 09:09
Last Modified: 19 Mar 2013 09:09
URI: http://eprints.iisc.ernet.in/id/eprint/46035

Actions (login required)

View Item View Item