Known Algorithms for Edge Clique Cover are Probably Optimal

  title={Known Algorithms for Edge Clique Cover are Probably Optimal},
  author={Marek Cygan and Marcin Pilipczuk and Michal Pilipczuk},
  journal={SIAM J. Comput.},
In the EDGE CLIQUE COVER (ECC) problem, given a graph G and an integer k, we ask whether the edges of G can be covered with k complete subgraphs of G or, equivalently, whether G admits an intersection model on k-element universe. Gramm et al. [JEA 2008] have shown a set of simple rules that reduce the number of vertices of G to 2^k, and no algorithm is known with significantly better running time bound than a brute-force search on this reduced instance. In this paper we show that the approach… 

Figures from this paper

Clique-width III
Lower bounds are provided for HAMILTONIAN CYCLE and GRAPH COLORING by proving a lower bound of n2o(k), which shows that GRAPHCOLORING behaves qualitatively different from the other three problems.
K3 Edge Cover Problem in a Wide Sense
: In this study, we consider a problem, for a given graph G = ( V , E ), of finding the minimum number of 3-cliques ( K 3 s) that cover all edges of G . Multiple covering or covering one edge by more
On the Parameterized Complexity of Biclique Cover and Partition
It is shown that it is possible to obtain approximation factors of n/log(n) for both problems, whereas the previous best approximation factor was n/sqrt( log(n).
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth
GC is the first natural problem known to require exponential dependence on the parameter in the exponent of n and is closed by proving a lower bound of n2o(k), which shows that GC behaves qualitatively different from the other three problems.
Tight Lower Bounds for List Edge Coloring
The main result states that list edge coloring for simple graphs does not admit an algorithm running in time, unless ETH fails, and the algorithm for edge coloring generalizes to the list version without any asymptotic slow-down.
On the kernel size of clique cover reductions for random intersection graphs
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with $n$ vertices and integer edge weights is given together with an integer $k$, and
Edge clique cover of claw‐free graphs
It is proved that if $ G $ is a connected claw-free graph on n vertices with $ alpha(G)geq 3 $, then $ cc(G)\leq n $ and equality holds if and only if G is either the graph of icosahedron, or the complement of a graph on $10$ vertices called twister or the power of the cycle.
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs
Steiner Tree is shown to be the first "genuinely planar" problem for which the square root phenomenon does not appear, and the combination of the results for Steiner Tree and Subset Traveling Salesman is the first to admit a parameter-preserving polynomial kernel on planar graphs unless ETH fails.


Algorithmic lower bounds for problems parameterized by clique-width
This paper obtains the asymptotically tight bounds for Max-Cut and Edge Dominating Set by showing that both problems cannot be solved in time f(t)no(t), unless Exponential Time Hypothesis (ETH) collapses; and can be solve in time nO(t, where f is an arbitrary function of t, on input of size n and clique-width at most t.
Strong computational lower bounds via parameterized complexity
Can you beat treewidth?
  • D. Marx
  • Computer Science, Mathematics
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
It is proved that if the running lime of A is f(G)nO(k/logk), where k is the treewidth of the primal graph G and f is an arbitrary function, then the Exponential Time Hypothesis fails.
Can visibility graphs Be represented compactly?
There exist visibility graphs of nonintersecting line segments inthe plane whose smallest clique cover has size, and it is shown that the visibilitygraph of a simple polygon always admits aClique cover of size.
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.
On Problems as Hard as CNF-SAT
It is shown that, for every ϵ <; 1, the problems HITTING SET, SET SPLITTING, and NAE-SAT cannot be computed in time O(2ϵn) unless SETH fails, and it is proved that the fastest known algorithms for STEINTER TREE, CONNECTED VERTEX COVER, SET PARTITIONing, and the pseudo-polynomial time algorithm for SUBSET SUM cannot be significantly improved.
The Complexity of Satisfiability of Small Depth Circuits
An improved randomized algorithm for the satisfiability problem for circuits of constant depth d and a linear number of gates cn is shown: for each d and c, the running time is 2(1 ? ?)n where the improvement $\delta\geq 1/O(c^{2-2-1}\lg^{3\cdot 2^{d-2}- 2}c)$, and the constant in the big-Oh depends only on d.
Contentment in graph theory: Covering graphs with cliques
Tight lower bounds for certain parameterized NP-hard problems
  • Jianer Chen, B. Chor, Ge Xia
  • Computer Science
    Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
  • 2004
It is proved that a group of parameterized NP-hard problems, including weighted SAT, dominating set, hitting set, set cover, and feature set, cannot be solved in time n/sup o(k)/poly(m), where n is the size of the universal set from which the k elements are to be selected and m is the instance size.
On a clique covering problem of orlin