{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T17:37:00Z","timestamp":1790789820287,"version":"4.1.0"},"reference-count":50,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>In the Edge Clique Cover (ECC) problem, given an undirected graph $G$ and an integer $k$, we ask whether one can choose $k$ cliques in $G$ such that each edge of $G$ is contained in at least one of the chosen cliques. Gramm et al. [ACM J. Exp. Algorithmics, 13 (2008)] have shown a set of simple rules that reduce the number of vertices of $G$ to $2^k$ while preserving the answer to the instance at hand, that is, they have shown a kernel for the problem with at most $2^k$ vertices. No algorithm is known with significantly better running time bound than a brute-force search on this kernel. In this paper, we show that the approach of Gramm et al. is essentially optimal: we present a polynomial-time algorithm that reduces an arbitrary instance of $3$-CNF-SAT with $n$ variables and $m$ clauses to an equivalent ECC instance $(G,k)$ with $k = \\mathcal{O}(\\log n)$ and $|V(G)| = \\mathcal{O}(n + m)$. Consequently, there is no $2^{2^{o(k)}}{\\rm poly}(n)$ time algorithm for the ECC problem, unless the Exponential Time Hypothesis fails. Moreover, our reduction also implies that, unless P $ = $ NP, the ECC problem does not admit a subexponential kernel, i.e., a kernel of size $2^{o(k)}$.<\/jats:p>","DOI":"10.1137\/130947076","type":"journal-article","created":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T16:56:41Z","timestamp":1452790601000},"page":"67-83","source":"Crossref","is-referenced-by-count":33,"title":["Known Algorithms for Edge Clique Cover are Probably Optimal"],"prefix":"10.1137","volume":"45","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574385"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi,\n                      Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties\n                      , Springer, New York, 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.005"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.04.001"},{"key":"atypb5","first-page":"75","volume":"2009","author":"Calabro C.","year":"2009","journal-title":"Proceedings of IWPEC"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/090757575"},{"key":"atypb7","unstructured":"M.S. Chang, T. Kloks, and C.H. Liu,\n                      Edge-clique graphs of cocktail parties have unbounded rankwidth\n                      , CoRR abs\/1205.2483, 2012."},{"key":"atypb8","first-page":"44","volume":"2001","author":"Chang M.-S.","year":"2001","journal-title":"Proceedings of WG"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.05.001"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/050646354"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-7137-6"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.04.007"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9270-y"},{"key":"atypb14","first-page":"74","author":"Cygan M.","year":"2012","journal-title":"Proceedings of"},{"key":"atypb15","first-page":"301","volume":"2013","author":"Cygan M.","year":"2013","journal-title":"Proceedings of STOC"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1145\/2594439"},{"key":"atypb17","first-page":"150","volume":"2011","author":"Cygan M.","year":"2011","journal-title":"Proceedings of FOCS"},{"key":"atypb18","first-page":"1044","volume":"2013","author":"Cygan M.","year":"2013","journal-title":"Proceedings of SODA"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1145\/2629620"},{"key":"atypb20","first-page":"609","volume":"2012","author":"Drucker A.","year":"2012","journal-title":"Proceedings of FOCS"},{"key":"atypb21","unstructured":"A. Drucker,\n                      New limits to classical and quantum instance compression\n                      , Electron. Colloq. Comput. Complexity (ECCC), 19 (2012), p. 112."},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.3233\/COM-13016"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-014-3"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1137\/130910932"},{"key":"atypb25","unstructured":"M. R. Garey and D. S. Johnson,\n                      Computers and Intractability: A Guide to the Theory of NP-Completeness\n                      , W.H. Freeman, New York, 1979."},{"key":"atypb26","first-page":"13","author":"Gramm J.","year":"2008","journal-title":"ACM J. Exp. Algorithmics"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2006.09.035"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90085-1"},{"key":"atypb29","doi-asserted-by":"crossref","unstructured":"J. L. Gross and J. Yellen,\n                      Graph Theory and its Applications\n                      , CRC Press, Boca Raton, FL, 2006.","DOI":"10.1201\/9781420057140"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.03.007"},{"key":"atypb31","first-page":"187","volume":"11","author":"Hoover D. N.","year":"1992","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90165-E"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"atypb35","first-page":"544","volume":"16","author":"Kellerman E.","year":"1973","journal-title":"IBM Tech. Disclosure Bull."},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359346"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.11.021"},{"key":"atypb38","first-page":"777","volume":"2011","author":"Lokshtanov D.","year":"2011","journal-title":"Proceedings of SODA"},{"key":"atypb39","first-page":"41","volume":"105","author":"Lokshtanov D.","year":"2011","journal-title":"Bull. EATCS"},{"key":"atypb40","first-page":"760","volume":"2011","author":"Lokshtanov D.","year":"2011","journal-title":"Proceedings of SODA"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1145\/185675.306789"},{"key":"atypb42","first-page":"151","volume":"36","author":"Ma S.","year":"1989","journal-title":"Util. Math."},{"key":"atypb43","first-page":"338","volume":"2007","author":"Marx D.","year":"2007","journal-title":"Proceedings of FOCS"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2010.v006a005"},{"key":"atypb45","first-page":"469","author":"Marx D.","year":"2012","journal-title":"New York"},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(77)90055-5"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1198\/1061860043515"},{"key":"atypb48","unstructured":"M. Pilipczuk,\n                      Tournaments and Optimality: New Results in Parameterized Complexity\n                      , Ph.D. thesis, University of Bergen, Bergen, Norway, 2013."},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1145\/354880.354902"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90061-7"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/130947076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:54:45Z","timestamp":1787338485000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/130947076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1137\/130947076"],"URL":"https:\/\/doi.org\/10.1137\/130947076","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}