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

Sublinear approximation algorithms for boxicity and related problems

Adiga, Abhijin and Babu, Jasine and Chandran, Sunil L (2018) Sublinear approximation algorithms for boxicity and related problems. In: DISCRETE APPLIED MATHEMATICS, 236 . pp. 7-22.

[img] PDF
Dis_App_Mat_236_7-22_2018.pdf - Published Version
Restricted to Registered users only

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

Abstract

The boxicity 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 in R-k. Cubicity is a variant of boxicity, where the axis parallel boxes in the intersection representation are restricted to be of unit length sides. Deciding whether the boxicity (resp. cubicity) of a graph is at most k is NP-hard, even for k = 2 or 3. Computing these parameters is inapproximable within O(n(1 -) (epsilon))-factor, for any epsilon > 0 in polynomial time unless NP = ZPP, even for many simple graph classes. In this paper, we give a polynomial time k(n) factor approximation algorithm for computing boxicity and a K(n)log logn] factor approximation algorithm for computing the cubicity, where K(n) = 2 n root loglogn / root logn]. These o(n) factor approximation algorithms also produce the corresponding box (resp. cube) representations. As a special case, this resolves the question posed by Spinrad (2003) about polynomial time construction of o(n) dimensional box representations for boxicity 2 graphs. Other consequences of our approximation algorithm include 0(K(n)) factor approximation algorithms for computing the following parameters: the partial order dimension (poset dimension) of finite posets, the interval dimension of finite posets, minimum chain cover of bipartite graphs, Ferrers dimension of digraphs and threshold dimension of split graphs and co-bipartite graphs. Each of these parameters is inapproximable within an O(n(1 -) (epsilon))-factor, for any e > 0 in polynomial time unless NP = ZPP and the algorithms we derive seem to be the first o(n) factor approximation algorithms known for all these problems. We note that obtaining a o(n) factor approximation for poset dimension was also mentioned as an open problem by Felsner et al. (2017). In the second part of this paper, parameterized approximation algorithms for boxicity using various edit distance parameters are derived. We also present a parameterized approximation scheme for cubicity, using minimum vertex cover number as the parameter. (C) 2017 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Additional Information: Copy right for this article belong to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Id for Latest eprints
Date Deposited: 02 Mar 2018 14:56
Last Modified: 28 Feb 2019 08:37
URI: http://eprints.iisc.ac.in/id/eprint/59038

Actions (login required)

View Item View Item