{"id":"https://openalex.org/W4387376832","doi":"https://doi.org/10.1145/3626824","title":"Shortest Cycles with Monotone Submodular Costs","display_name":"Shortest Cycles with Monotone Submodular Costs","publication_year":2023,"publication_date":"2023-10-05","ids":{"openalex":"https://openalex.org/W4387376832","doi":"https://doi.org/10.1145/3626824"},"language":"en","primary_location":{"id":"doi:10.1145/3626824","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626824","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0003-1955-4612","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0002-2619-2990","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080387266","display_name":"Tuukka Korhonen","orcid":"https://orcid.org/0000-0003-0861-6515"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Tuukka Korhonen","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0003-0861-6515","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, USA"],"raw_orcid":"https://orcid.org/0000-0002-3166-9212","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070659804","display_name":"Giannos Stamoulis","orcid":"https://orcid.org/0000-0002-4175-7793"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Giannos Stamoulis","raw_affiliation_strings":["LIRMM, University of Montpellier, CNRS, France"],"raw_orcid":"https://orcid.org/0000-0002-4175-7793","affiliations":[{"raw_affiliation_string":"LIRMM, University of Montpellier, CNRS, France","institution_ids":["https://openalex.org/I4210101743","https://openalex.org/I19894307","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19749569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"1","first_page":"1","last_page":"16"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9919000267982483,"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/submodular-set-function","display_name":"Submodular set function","score":0.8575744032859802},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7839235067367554},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7478426098823547},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6972043514251709},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5655658841133118},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5438045859336853},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5326962471008301},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5101721286773682},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.5072562098503113},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4828089475631714},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.45334482192993164},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4521874487400055},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4474159777164459},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43650147318840027},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4343471825122833},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41200098395347595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12915483117103577}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8575744032859802},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7839235067367554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7478426098823547},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6972043514251709},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5655658841133118},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5438045859336853},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5326962471008301},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5101721286773682},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.5072562098503113},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4828089475631714},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.45334482192993164},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4521874487400055},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4474159777164459},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43650147318840027},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4343471825122833},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41200098395347595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12915483117103577},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3626824","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626824","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1302621641","display_name":"Unifying Theories for Multivariate Algorithms","funder_award_id":"ANR-20-CE92-0027","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G1535968106","display_name":"Efficiency and Structure in Graph Mining Applications","funder_award_id":"ANR-17-CE23-0010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5399623649","display_name":null,"funder_award_id":"314528","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G6803667113","display_name":null,"funder_award_id":"ANR-17","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1572332593","https://openalex.org/W2012329067","https://openalex.org/W2015429465","https://openalex.org/W2016115187","https://openalex.org/W2029828838","https://openalex.org/W2035575256","https://openalex.org/W2070208123","https://openalex.org/W2128059732","https://openalex.org/W2134944545","https://openalex.org/W2163169902","https://openalex.org/W2169528473","https://openalex.org/W2241574292","https://openalex.org/W2569484595","https://openalex.org/W2595601445","https://openalex.org/W2963220807","https://openalex.org/W4245608944","https://openalex.org/W4285787231","https://openalex.org/W4316652342","https://openalex.org/W6735386961"],"related_works":["https://openalex.org/W4385627918","https://openalex.org/W4252399622","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2367244625","https://openalex.org/W2338410001","https://openalex.org/W2554369515","https://openalex.org/W2403340448","https://openalex.org/W2755229948"],"abstract_inverted_index":{"We":[0,47,129,138,242],"introduce":[1],"the":[2,7,21,24,64,94,97,113,159,162,253,274],"following":[3],"submodular":[4,15,202,249],"generalization":[5],"of":[6,26,40,96,173,200,247,255,273,291],"Shortest":[8,102],"Cycle":[9],"problem.":[10],"For":[11,270],"a":[12,35,78,134,147,171,194,198,206,212,216,225,262],"nonnegative":[13],"monotone":[14,248],"cost":[16,42,174],"function":[17,65,163],"f":[18,66,164],"defined":[19],"on":[20],"edges":[22],"(or":[23],"vertices)":[25],"an":[27,49,53,69,117,265],"undirected":[28],"graph":[29,56],"G":[30,39,57,82,268],",":[31,58],"we":[32,223,278],"seek":[33],"for":[34,115,141,187],"cycle":[36,79,172,199,263],"C":[37,80],"in":[38,71,81,90,179,264],"minimum":[41,201],"\ud835\uddae\ud835\uddaf\ud835\uddb3":[43,175,188],"=":[44,189],"f(C)":[45,84],".":[46,184,269],"give":[48],"algorithm":[50,132,168,196,208],"that":[51,140,170,215,228],"given":[52],"n":[54,73,118,152,181,190,229,231,240],"-vertex":[55],"parameter":[59],"\u025b":[60,143],">":[61,144],"0,":[62,145],"and":[63,283],"represented":[67],"by":[68],"oracle,":[70],"time":[72,180,218],"\ud835\udcaa":[74],"(log":[75,154],"1/\u025b)":[76],"finds":[77],"with":[83,93,133],"\u2264":[85],"(1+\u025b).":[86],"\ud835\uddae\ud835\uddaf\ud835\uddb3.":[87],"This":[88],"is":[89,165],"sharp":[91],"contrast":[92],"non-approximability":[95],"closely":[98],"related":[99],"Monotone":[100],"Submodular":[101],"(":[103],"s,t":[104],"-Path":[105],"problem,":[106,277],"which":[107],"requires":[108,149],"exponentially":[109],"many":[110],"queries":[111,157,233],"to":[112,158,252,260,288],"oracle":[114],"finding":[116],"2/3-\u025b":[119],"-approximation":[120],"Goel":[121],"et":[122],"al.":[123],"[":[124],"7":[125],"],":[126],"FOCS":[127],"2009.":[128],"complement":[130],"our":[131,167],"matching":[135],"lower":[136,226],"bound.":[137],"show":[139,224],"every":[142],"obtaining":[146],"(1+\u025b)-approximation":[148],"at":[150],"least":[151],"\u03a9":[153],"1/":[155],"\u025b)":[156],"oracle.":[160],"When":[161],"integer-valued,":[166],"yields":[169],"can":[176],"be":[177,221],"found":[178],"\ud835\udcaa(log":[182,230],"\ud835\uddae\ud835\uddaf\ud835\uddb3)":[183],"In":[185],"particular,":[186],"\ud835\udcaa(1)":[191],"this":[192],"gives":[193],"quasipolynomial-time":[195,207],"computing":[197],"cost.":[203],"Interestingly,":[204],"while":[205],"often":[209],"serves":[210],"as":[211],"good":[213],"indication":[214],"polynomial":[217],"complexity":[219],"could":[220],"achieved,":[222],"bound":[227],")":[232],"are":[234],"required":[235],"even":[236],"when":[237,286],"\ud835\uddae\ud835\uddaf\ud835\uddb3=":[238],"\ud835\udcaa(":[239],").":[241],"also":[243],"consider":[244],"special":[245,271],"cases":[246,272],"functions,":[250],"corresponding":[251,275],"number":[254],"different":[256],"color":[257],"classes":[258,290],"needed":[259],"cover":[261],"edge-colored":[266],"multigraph":[267],"minimization":[276],"obtain":[279],"fixed-parameter":[280],"tractable":[281],"algorithms":[282],"polynomial-time":[284],"algorithms,":[285],"restricted":[287],"certain":[289],"inputs.":[292]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}