Sublinear approximation algorithms for boxicity and related problems
نویسندگان
چکیده
منابع مشابه
Sublinear approximation algorithms for boxicity and related problems
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 Rk. 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 boxicity (resp. cubicity) of a graph is at most k is NP-hard, even for k = 2 or 3. Computing thes...
متن کاملParameterized and Approximation Algorithms for Boxicity
Boxicity of a graph G(V, E), denoted by box(G), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes in R. The problem of computing boxicity is inapproximable even for graph classes like bipartite, co-bipartite and split graphs within O(n)-factor, for any ǫ > 0 in polynomial time unless NP = ZPP . We give FPT approximation algorithms for compu...
متن کاملSublinear Graph Approximation Algorithms
Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover size, the minimum dominating set size Krzysztof Onak – Sublinear Graph Approximation Algorithms – p. 2/32 Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover siz...
متن کاملSublinear-Time Parallel Algorithms for Matching and Related Problems
This paper presents the first sublinear-time deterministic parallel algorithms fix bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to...
متن کاملParameterized Algorithms for Boxicity
In this paper we initiate an algorithmic study of Boxicity, a combinatorially well studied graph invariant, from the viewpoint of parameterized algorithms. The boxicity of an arbitrary graph G with the vertex set V (G) and the edge set E(G), denoted by box(G), is the minimum number of interval graphs on the same set of vertices such that the intersection of the edge sets of the interval graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.10.031