{"id":"https://openalex.org/W4414128350","doi":"https://doi.org/10.1007/s10618-025-01142-2","title":"Optirefine: densest subgraphs and maximum cuts with k refinements","display_name":"Optirefine: densest subgraphs and maximum cuts with k refinements","publication_year":2025,"publication_date":"2025-09-11","ids":{"openalex":"https://openalex.org/W4414128350","doi":"https://doi.org/10.1007/s10618-025-01142-2"},"language":"en","primary_location":{"id":"doi:10.1007/s10618-025-01142-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10618-025-01142-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10618-025-01142-2.pdf","source":{"id":"https://openalex.org/S121920818","display_name":"Data Mining and Knowledge Discovery","issn_l":"1384-5810","issn":["1384-5810","1573-756X"],"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":"Data Mining and Knowledge Discovery","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/s10618-025-01142-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014563105","display_name":"Sijing Tu","orcid":"https://orcid.org/0000-0002-5976-1993"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Sijing Tu","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055086773","display_name":"Aleksa Stankovi\u0107","orcid":"https://orcid.org/0000-0002-8416-8665"},"institutions":[{"id":"https://openalex.org/I4210095837","display_name":"Systembolaget (Sweden)","ror":"https://ror.org/00nfs4461","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210095837"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Aleksa Stankovic","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden","Qubos Systematic, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Qubos Systematic, Stockholm, Sweden","institution_ids":["https://openalex.org/I4210095837"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008120721","display_name":"Stefan Neumann","orcid":"https://orcid.org/0000-0002-3981-1500"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Neumann","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022164041","display_name":"Aristides Gionis","orcid":"https://orcid.org/0000-0002-5211-112X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Aristides Gionis","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5014563105"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23827387,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"6","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/heuristics","display_name":"Heuristics","score":0.6798999905586243},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6797000169754028},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5794000029563904},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5478000044822693},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.44850000739097595},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42170000076293945},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4081000089645386}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6798999905586243},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6797000169754028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6327000260353088},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5794000029563904},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.570900022983551},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5478000044822693},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42170000076293945},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3968000113964081},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30809998512268066},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C2779982483","wikidata":"https://www.wikidata.org/wiki/Q6094420","display_name":"Iterative refinement","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10618-025-01142-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10618-025-01142-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10618-025-01142-2.pdf","source":{"id":"https://openalex.org/S121920818","display_name":"Data Mining and Knowledge Discovery","issn_l":"1384-5810","issn":["1384-5810","1573-756X"],"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":"Data Mining and Knowledge Discovery","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10618-025-01142-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10618-025-01142-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10618-025-01142-2.pdf","source":{"id":"https://openalex.org/S121920818","display_name":"Data Mining and Knowledge Discovery","issn_l":"1384-5810","issn":["1384-5810","1573-756X"],"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":"Data Mining and Knowledge Discovery","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322509","display_name":"Kungliga Tekniska H\u00f6gskolan","ror":"https://ror.org/026vcq606"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414128350.pdf"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W129224317","https://openalex.org/W1500512125","https://openalex.org/W1502940150","https://openalex.org/W1512148653","https://openalex.org/W1535144194","https://openalex.org/W1601503375","https://openalex.org/W1921746303","https://openalex.org/W1964419312","https://openalex.org/W1977458171","https://openalex.org/W1985123706","https://openalex.org/W1997672673","https://openalex.org/W2005499394","https://openalex.org/W2019044741","https://openalex.org/W2019404063","https://openalex.org/W2030365814","https://openalex.org/W2032279394","https://openalex.org/W2032321507","https://openalex.org/W2034543148","https://openalex.org/W2036836182","https://openalex.org/W2038225707","https://openalex.org/W2072802070","https://openalex.org/W2080905757","https://openalex.org/W2115659887","https://openalex.org/W2119757574","https://openalex.org/W2120358419","https://openalex.org/W2127816126","https://openalex.org/W2133591726","https://openalex.org/W2134737843","https://openalex.org/W2153952206","https://openalex.org/W2200725028","https://openalex.org/W2260890852","https://openalex.org/W2613308084","https://openalex.org/W2949580236","https://openalex.org/W2963378411","https://openalex.org/W2977701101","https://openalex.org/W2984323893","https://openalex.org/W3018223018","https://openalex.org/W3035455649","https://openalex.org/W3101796089","https://openalex.org/W3126188815","https://openalex.org/W4206265813","https://openalex.org/W4281922064","https://openalex.org/W4281977994","https://openalex.org/W4380715560","https://openalex.org/W4387171996","https://openalex.org/W4393085118","https://openalex.org/W4401863545"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Abstract":[0],"Data-analysis":[1],"tasks":[2],"often":[3],"involve":[4],"an":[5,198],"iterative":[6],"process,":[7],"which":[8,51,177],"requires":[9],"refining":[10],"previous":[11],"solutions.":[12],"For":[13,129],"instance,":[14],"when":[15],"analyzing":[16],"social":[17],"networks,":[18],"we":[19,29,72,134],"may":[20],"obtain":[21],"initial":[22,66,81,101],"communities":[23,59],"based":[24],"on":[25,223],"noisy":[26],"metadata,":[27],"and":[28,38,103,125,159,196,220,225,228],"want":[30],"to":[31,64,99,118,181,189],"improve":[32,182],"them":[33],"by":[34,83,140],"adding":[35,141],"influential":[36],"nodes":[37],"removing":[39,143],"non-important":[40],"ones,":[41],"without":[42],"making":[43,84],"too":[44],"many":[45],"changes.":[46],"However,":[47],"classic":[48,120],"optimization":[49,111],"algorithms,":[50],"typically":[52],"find":[53],"solutions":[54,82],"from":[55],"scratch,":[56],"potentially":[57],"return":[58],"that":[60,93,148,230],"are":[61,232],"very":[62],"dissimilar":[63],"the":[65,74,94,100,110,115,130,178,190,207],"one.":[67],"To":[68],"mitigate":[69],"these":[70],"issues,":[71],"introduce":[73],"OptiRefine":[75,116],"framework":[76,79,117],".":[77,128],"The":[78],"optimizes":[80],"a":[85,106,136,153,171,183],"small":[86],"number":[87],"of":[88,155,173],"refinements":[89],",":[90,133],"thereby":[91],"ensuring":[92],"new":[95],"solution":[96,102,108],"remains":[97],"close":[98],"simultaneously":[104],"achieving":[105],"near-optimal":[107],"for":[109,164,211],"problem.":[112],"We":[113,146,168,186,215],"apply":[114],"two":[119],"graph-optimization":[121],"problems:":[122],"densest":[123],"subgraph":[124],"maximum":[126,174,191],"cut":[127,175,192],"densest-subgraph":[131],"problem":[132,151],"optimize":[135],"given":[137,184],"subgraph\u2019s":[138],"density":[139],"or":[142],"k":[144,156],"nodes.":[145],"show":[147,229],"this":[149],"novel":[150],"is":[152,180],"generalization":[154],"-densest":[157],"subgraph,":[158],"provide":[160,187,197],"constant-factor":[161],"approximation":[162,200],"algorithms":[163],"$$k=\\Omega":[165,212],"(n)$$":[166,213],"refinements.":[167,214],"also":[169],"study":[170],"version":[172],"in":[176,202,235],"goal":[179],"cut.":[185],"connections":[188],"with":[193],"cardinality":[194],"constraints":[195],"optimal":[199],"algorithm":[201],"most":[203],"parameter":[204],"regimes":[205],"under":[206],"Unique":[208],"Games":[209],"Conjecture":[210],"evaluate":[216],"our":[217],"theoretical":[218],"methods":[219],"scalable":[221],"heuristics":[222],"synthetic":[224],"real-world":[226],"data":[227],"they":[231],"highly":[233],"effective":[234],"practice.":[236]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}