{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T21:32:00Z","timestamp":1780349520586,"version":"3.54.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T00:00:00Z","timestamp":1604448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T00:00:00Z","timestamp":1604448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100015968","name":"Universit\u00e0 degli Studi di Bergamo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100015968","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,1]]},"abstract":"Abstract<\/jats:title>A central problem in graph mining is finding dense subgraphs, with several applications in different fields, a notable example being identifying communities. While a lot of effort has been put in the problem of finding a single dense subgraph, only recently the focus has been shifted to the problem of finding a set of densest subgraphs. An approach introduced to find possible overlapping subgraphs is the problem. Given an integer $$k \\ge 1$$<\/jats:tex-math>\n \n k<\/mml:mi>\n \u2265<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and a parameter $$\\lambda > 0$$<\/jats:tex-math>\n \n \u03bb<\/mml:mi>\n ><\/mml:mo>\n 0<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, the goal of this problem is to find a set of k<\/jats:italic> dense subgraphs that may share some vertices. The objective function to be maximized takes into account the density of the subgraphs, the parameter $$\\lambda $$<\/jats:tex-math>\n \u03bb<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and the distance between each pair of subgraphs in the solution. The problem has been shown to admit a $$\\frac{1}{10}$$<\/jats:tex-math>\n \n 1<\/mml:mn>\n 10<\/mml:mn>\n <\/mml:mfrac>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-factor approximation algorithm. Furthermore, the computational complexity of the problem has been left open. In this paper, we present contributions concerning the approximability and the computational complexity of the problem. For the approximability, we present approximation algorithms that improve the approximation factor to $$\\frac{1}{2}$$<\/jats:tex-math>\n \n 1<\/mml:mn>\n 2<\/mml:mn>\n <\/mml:mfrac>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, when k<\/jats:italic> is smaller than the number of vertices in the graph, and to $$\\frac{2}{3}$$<\/jats:tex-math>\n \n 2<\/mml:mn>\n 3<\/mml:mn>\n <\/mml:mfrac>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, when k<\/jats:italic> is a constant. For the computational complexity, we show that the problem is NP-hard even when $$k=3$$<\/jats:tex-math>\n \n k<\/mml:mi>\n =<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s10878-020-00664-3","type":"journal-article","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T09:09:22Z","timestamp":1604480962000},"page":"80-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Top-k overlapping densest subgraphs: approximation algorithms and computational complexity"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6124-2965","authenticated-orcid":false,"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad Mehdi","family":"Hosseinzadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Italo","family":"Zoppis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"664_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba RD (1973) A graph-theoretic definition of a sociometric clique. J Math Sociol 3:113\u2013126","journal-title":"J Math Sociol"},{"key":"664_CR2","doi-asserted-by":"crossref","unstructured":"Andersen R, Chellapilla K (2009) Finding dense subgraphs with size bounds. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) Algorithms and models for the web-graph, 6th international workshop, WAW 2009, Barcelona, Spain, February 12\u201313, 2009. Proceedings. Lecture notes in computer science, vol 5427. Springer, pp 25\u201337","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"664_CR3","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1007\/s00453-017-0344-y","volume":"80","author":"Y Asahiro","year":"2017","unstructured":"Asahiro Y, Doiya Y, Miyano E, Samizo K, Shimizu H (2017) Optimal approximation algorithms for maximum distance-bounded subgraph problems. Algorithmica 80:1834\u20131856","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"664_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro Y, Hassin R, Iwama K (2002) Complexity of finding dense subgraphs. Discrete Appl Math 121(1\u20133):15\u201326","journal-title":"Discrete Appl Math"},{"key":"664_CR5","doi-asserted-by":"crossref","unstructured":"Asahiro Y, Iwama K, Tamaki H, Tokuyama T (1996) Greedily finding a dense subgraph. In: Karlsson RG, Lingas A (eds) Algorithm Theory\u2014SWAT \u201996, 5th Scandinavian workshop on algorithm theory, Reykjav\u00edk, Iceland, July 3\u20135, 1996, Proceedings. Lecture Notes in Computer Science, vol 1097. Springer, pp 136\u2013148","DOI":"10.1007\/3-540-61422-2_127"},{"key":"664_CR6","doi-asserted-by":"crossref","unstructured":"Balalau OD, Bonchi F, Chan TH, Gullo F, Sozio M (2015) Finding subgraphs with maximum total density and limited overlap. In: Cheng, X, Li H, Gabrilovich E, Tang J (eds) Proceedings of the eighth ACM international conference on web search and data mining, WSDM 2015. ACM, pp 379\u2013388","DOI":"10.1145\/2684822.2685298"},{"issue":"1","key":"664_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J Bourjolly","year":"2002","unstructured":"Bourjolly J, Laporte G, Pesant G (2002) An exact algorithm for the maximum k-club problem in an undirected graph. Eur J Oper Res 138(1):21\u201328","journal-title":"Eur J Oper Res"},{"key":"664_CR8","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: Jansen K, Khuller S (eds) Approximation algorithms for combinatorial optimization, third international workshop, APPROX 2000, Proceedings. Lecture notes in computer science, vol 1913. Springer, pp 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"key":"664_CR9","doi-asserted-by":"crossref","unstructured":"Dondi R, Hosseinzadeh MM, Mauri G, Zoppis I (2019) Top-k overlapping densest subgraphs: approximation and complexity. In: Proceeding of ICTCS 2019 (to appear)","DOI":"10.1007\/s10878-020-00664-3"},{"issue":"2","key":"664_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.7155\/jgaa.00491","volume":"23","author":"R Dondi","year":"2019","unstructured":"Dondi R, Mauri G, Sikora F, Zoppis I (2019) Covering a graph with clubs. J Graph Algorithms Appl 23(2):271\u2013292","journal-title":"J Graph Algorithms Appl"},{"issue":"3","key":"664_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige U, Kortsarz G, Peleg D (2001) The dense k-subgraph problem. Algorithmica 29(3):410\u2013421","journal-title":"Algorithmica"},{"issue":"14","key":"664_CR12","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin E, Naughton BT, Brutlag DL, Batzoglou S (2006) Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14):156\u2013157","journal-title":"Bioinformatics"},{"issue":"5","key":"664_CR13","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1007\/s10618-016-0464-z","volume":"30","author":"E Galbrun","year":"2016","unstructured":"Galbrun E, Gionis A, Tatti N (2016) Top-k overlapping densest subgraphs. Data Min Knowl Discov 30(5):1134\u20131165","journal-title":"Data Min Knowl Discov"},{"key":"664_CR14","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co., London"},{"key":"664_CR15","unstructured":"Goldberg AV (1984) Finding a maximum density subgraph. Tech. rep, Berkeley, CA, USA"},{"key":"664_CR16","unstructured":"Goldstein D, Langberg M (2009) The dense k subgraph problem. CoRR abs\/0912.5327"},{"issue":"2","key":"664_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"P Jaccard","year":"1912","unstructured":"Jaccard P (1912) The distribution of the flora in the alpine zone. New Phytol 11(2):37\u201350","journal-title":"New Phytol"},{"key":"664_CR18","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Proceedings of a symposium on the complexity of computer computations. The IBM research symposia series, Plenum Press, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"12","key":"664_CR19","doi-asserted-by":"publisher","first-page":"3461","DOI":"10.1007\/s00453-017-0400-7","volume":"80","author":"Y Kawase","year":"2018","unstructured":"Kawase Y, Miyauchi A (2018) The densest subgraph problem with a convex\/concave size function. Algorithmica 80(12):3461\u20133480","journal-title":"Algorithmica"},{"key":"664_CR20","doi-asserted-by":"crossref","unstructured":"Khuller S, Saha B (2009) On finding dense subgraphs. In: Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas SE, Thomas W (eds) Automata, languages and programming, 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5\u201312, 2009, Proceedings, Part I. Lecture notes in computer science, vol 5555. Springer, pp 597\u2013608","DOI":"10.1007\/978-3-642-02927-1_50"},{"issue":"1","key":"664_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/a9010021","volume":"9","author":"C Komusiewicz","year":"2016","unstructured":"Komusiewicz C (2016) Multivariate algorithmics for finding cohesive subnetworks. Algorithms 9(1):21","journal-title":"Algorithms"},{"issue":"11\u201316","key":"664_CR22","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R Kumar","year":"1999","unstructured":"Kumar R, Raghavan P, Rajagopalan S, Tomkins A (1999) Trawling the web for emerging cyber-communities. Comput Netw 31(11\u201316):1481\u20131493","journal-title":"Comput Netw"},{"issue":"1","key":"664_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"issue":"2","key":"664_CR24","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken R (1979) Cliques, clubs and clans. Qual Quant Int J Methodol 13(2):161\u2013173","journal-title":"Qual Quant Int J Methodol"},{"key":"664_CR25","doi-asserted-by":"crossref","unstructured":"Nasir MAU, Gionis A, Morales GDF, Girdzijauskas S (2017) Fully dynamic algorithm for top-k densest subgraphs. In: Lim E, Winslett M, Sanderson M, Fu AW, Sun J, Culpepper JS, Lo E, Ho JC, Donato D, Agrawal R, Zheng Y, Castillo C, Sun A, Tseng VS, Li C (eds) Proceedings of the 2017 ACM on conference on information and knowledge management, CIKM 2017. ACM, pp 1817\u20131826","DOI":"10.1145\/3132847.3132966"},{"key":"664_CR26","unstructured":"Zou Z (2013) Polynomial-time algorithm for finding densest subgraphs in uncertain graphs. In: Proceedings of international workshop on mining and learning with graphs"},{"issue":"1","key":"664_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman D (2007) Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput 3(1):103\u2013128","journal-title":"Theory Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00664-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00664-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00664-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,24]],"date-time":"2021-01-24T03:10:09Z","timestamp":1611457809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00664-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,4]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["664"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00664-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,4]]},"assertion":[{"value":"16 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}