{"id":"https://openalex.org/W3096155759","doi":"https://doi.org/10.1007/s10878-020-00664-3","title":"Top-k overlapping densest subgraphs: approximation algorithms and computational complexity","display_name":"Top-k overlapping densest subgraphs: approximation algorithms and computational complexity","publication_year":2020,"publication_date":"2020-11-04","ids":{"openalex":"https://openalex.org/W3096155759","doi":"https://doi.org/10.1007/s10878-020-00664-3","mag":"3096155759"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-020-00664-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-020-00664-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-020-00664-3.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-020-00664-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059320347","display_name":"Riccardo Dondi","orcid":"https://orcid.org/0000-0002-6124-2965"},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Riccardo Dondi","raw_affiliation_strings":["Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy"],"raw_orcid":"https://orcid.org/0000-0002-6124-2965","affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034996367","display_name":"Mohammad Mehdi Hosseinzadeh","orcid":"https://orcid.org/0000-0003-3275-6286"},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mohammad Mehdi Hosseinzadeh","raw_affiliation_strings":["Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073163964","display_name":"Giancarlo Mauri","orcid":"https://orcid.org/0000-0003-3520-4022"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giancarlo Mauri","raw_affiliation_strings":["Universit\u00e0 degli Studi di Milano-Bicocca, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Milano-Bicocca, Milano, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047943010","display_name":"Italo Zoppis","orcid":"https://orcid.org/0000-0001-7312-7123"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Italo Zoppis","raw_affiliation_strings":["Universit\u00e0 degli Studi di Milano-Bicocca, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Milano-Bicocca, Milano, Italy","institution_ids":["https://openalex.org/I66752286"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059320347"],"corresponding_institution_ids":["https://openalex.org/I11039511"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":2.2796,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.90607918,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"41","issue":"1","first_page":"80","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7267450094223022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4983665943145752},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34249401092529297}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7267450094223022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4983665943145752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34249401092529297}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10878-020-00664-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-020-00664-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-020-00664-3.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00664-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-020-00664-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:aisberg.unibg.it:10446/200852","is_oa":true,"landing_page_url":"http://hdl.handle.net/10446/200852","pdf_url":null,"source":{"id":"https://openalex.org/S4377196347","display_name":"Aisberg (University of Bergamo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11039511","host_organization_name":"University of Bergamo","host_organization_lineage":["https://openalex.org/I11039511"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:boa.unimib.it:10281/300658","is_oa":true,"landing_page_url":"http://hdl.handle.net/10281/300658","pdf_url":null,"source":{"id":"https://openalex.org/S4306401259","display_name":"BOA (University of Milano-Bicocca)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10878-020-00664-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-020-00664-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-020-00664-3.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316219","display_name":"Universit\u00e0 degli studi di Bergamo","ror":"https://ror.org/02mbd5571"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3096155759.pdf","grobid_xml":"https://content.openalex.org/works/W3096155759.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W183656749","https://openalex.org/W1500512125","https://openalex.org/W1535144194","https://openalex.org/W1555788915","https://openalex.org/W1660722709","https://openalex.org/W1888358353","https://openalex.org/W1987173300","https://openalex.org/W2011039300","https://openalex.org/W2036836182","https://openalex.org/W2089494972","https://openalex.org/W2100978151","https://openalex.org/W2115659887","https://openalex.org/W2121526866","https://openalex.org/W2123402141","https://openalex.org/W2146591355","https://openalex.org/W2151626491","https://openalex.org/W2153250079","https://openalex.org/W2300144455","https://openalex.org/W2398413754","https://openalex.org/W2401610261","https://openalex.org/W2610183793","https://openalex.org/W2738793986","https://openalex.org/W2752814093","https://openalex.org/W2776104937","https://openalex.org/W2891473438","https://openalex.org/W2937274722","https://openalex.org/W3096155759","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"central":[2],"problem":[3,33,49,101,150,174,253],"in":[4,14,31,146,226],"graph":[5],"mining":[6],"is":[7,65,102,219,242,254],"finding":[8,35,51],"dense":[9,38,109],"subgraphs,":[10,129],"with":[11],"several":[12],"applications":[13],"different":[15],"fields,":[16],"a":[17,24,36,52,83,105,156,243],"notable":[18],"example":[19],"being":[20],"identifying":[21],"communities.":[22],"While":[23],"lot":[25],"of":[26,34,50,54,99,107,127,144,172,192,224],"effort":[27],"has":[28,44,151,175],"been":[29,45,152,176],"put":[30],"the":[32,42,48,66,97,125,128,130,139,147,169,173,186,189,193,196,204,222,227,246,252],"single":[37],"subgraph,":[39],"only":[40],"recently":[41],"focus":[43],"shifted":[46],"to":[47,60,103,119,154,207,230],"set":[53,106],"densest":[55],"subgraphs.":[56],"An":[57],"approach":[58],"introduced":[59],"find":[61,104],"possible":[62],"overlapping":[63],"subgraphs":[64,110,145],"problem.":[67,194],"Given":[68],"an":[69],"integer":[70],"$$k":[71],"\\ge":[72],"1$$":[73],"<mml:math":[74,88,134,158,209,232,259],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[75,89,135,159,210,233,260],"<mml:mrow>":[76,90,261],"<mml:mi>k</mml:mi>":[77,262],"<mml:mo>\u2265</mml:mo>":[78],"<mml:mn>1</mml:mn>":[79,161,212],"</mml:mrow>":[80,94,265],"</mml:math>":[81,95,137,164,215,238,266],"and":[82,138,188,229],"parameter":[84,131],"$$\\lambda":[85,132],"&gt;":[86],"0$$":[87],"<mml:mi>\u03bb</mml:mi>":[91,136],"<mml:mo>&gt;</mml:mo>":[92],"<mml:mn>0</mml:mn>":[93],",":[96,216,239],"goal":[98],"this":[100,180],"k":[108,218,241],"that":[111,202,251],"may":[112],"share":[113],"some":[114],"vertices.":[115],"The":[116,149],"objective":[117],"function":[118],"be":[120],"maximized":[121],"takes":[122],"into":[123],"account":[124],"density":[126],"$$":[133],"distance":[140],"between":[141],"each":[142],"pair":[143],"solution.":[148],"shown":[153],"admit":[155],"$$\\frac{1}{10}$$":[157],"<mml:mfrac>":[160,211,234],"<mml:mn>10</mml:mn>":[162],"</mml:mfrac>":[163,214,237],"-factor":[165],"approximation":[166,200,205],"algorithm.":[167],"Furthermore,":[168],"computational":[170,190,247],"complexity":[171,191],"left":[177],"open.":[178],"In":[179],"paper,":[181],"we":[182,198,249],"present":[183,199],"contributions":[184],"concerning":[185],"approximability":[187],"For":[195,245],"approximability,":[197],"algorithms":[201],"improve":[203],"factor":[206],"$$\\frac{1}{2}$$":[208],"<mml:mn>2</mml:mn>":[213,235],"when":[217,240,257],"smaller":[220],"than":[221],"number":[223],"vertices":[225],"graph,":[228],"$$\\frac{2}{3}$$":[231],"<mml:mn>3</mml:mn>":[236,264],"constant.":[244],"complexity,":[248],"show":[250],"NP-hard":[255],"even":[256],"$$k=3$$":[258],"<mml:mo>=</mml:mo>":[263],".":[267]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2020-11-09T00:00:00"}