{"id":"https://openalex.org/W2896012830","doi":"https://doi.org/10.1137/20m1330415","title":"Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs","display_name":"Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W2896012830","doi":"https://doi.org/10.1137/20m1330415","mag":"2896012830"},"language":"en","primary_location":{"id":"doi:10.1137/20m1330415","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1330415","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1810.10229","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020003818","display_name":"Guillaume Ducoffe","orcid":"https://orcid.org/0000-0003-2127-5989"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Guillaume Ducoffe","raw_affiliation_strings":["University of Bucharest"],"affiliations":[{"raw_affiliation_string":"University of Bucharest","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020003818"],"corresponding_institution_ids":["https://openalex.org/I141595442"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00501148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"2","first_page":"953","last_page":"969"},"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.9440000057220459,"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.9440000057220459,"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.024299999698996544,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.00800000037997961,"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/combinatorics","display_name":"Combinatorics","score":0.7957004308700562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7572851777076721},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6023980975151062},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5385379195213318},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5010714530944824},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.4995095729827881},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4915712773799896},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4751341640949249},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.45772087574005127},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4337596297264099},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39550602436065674},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32057616114616394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07895132899284363}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7957004308700562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7572851777076721},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6023980975151062},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5385379195213318},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5010714530944824},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.4995095729827881},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4915712773799896},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4751341640949249},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.45772087574005127},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4337596297264099},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39550602436065674},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32057616114616394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07895132899284363},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/20m1330415","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1330415","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1810.10229","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1810.10229","pdf_url":"https://arxiv.org/pdf/1810.10229","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:HAL:hal-01905339v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01905339","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2018","raw_type":"Preprints, Working Papers, ..."},{"id":"pmh:oai:HAL:hal-02173350v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02173350","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.44⟩","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:hal-03225724v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03225724","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.953-969. ⟨10.1137/20M1330415⟩","raw_type":"Journal articles"},{"id":"pmh:oai:drops-oai.dagstuhl.de:10625","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.49","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.48550/arxiv.1810.10229","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1810.10229","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.icalp.2019.49","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2019.49","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1810.10229","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1810.10229","pdf_url":"https://arxiv.org/pdf/1810.10229","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2704700155","display_name":null,"funder_award_id":"EP/N008197/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6556096312","display_name":null,"funder_award_id":"Romania","funder_id":"https://openalex.org/F4320336189","funder_display_name":"Colegiul Consultativ pentru Cercetare-Dezvoltare \u015fi Inovare"},{"id":"https://openalex.org/G7430875941","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"},{"id":"https://openalex.org/G8854863702","display_name":null,"funder_award_id":"17PCCDI/2018","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320336189","display_name":"Colegiul Consultativ pentru Cercetare-Dezvoltare \u015fi Inovare","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1988067232","https://openalex.org/W1991858502","https://openalex.org/W2009852526","https://openalex.org/W2025590553","https://openalex.org/W2131676402","https://openalex.org/W2156306627","https://openalex.org/W2157760787","https://openalex.org/W2158860088","https://openalex.org/W2892948282"],"related_works":["https://openalex.org/W2750573468","https://openalex.org/W2735166887","https://openalex.org/W3017555096","https://openalex.org/W2250978763","https://openalex.org/W2980994391","https://openalex.org/W2952708184","https://openalex.org/W2903540361","https://openalex.org/W3081561662","https://openalex.org/W2030863680","https://openalex.org/W3038718897","https://openalex.org/W2088168571","https://openalex.org/W2047489708","https://openalex.org/W2123734400","https://openalex.org/W2963352410","https://openalex.org/W2951523126","https://openalex.org/W3168800553","https://openalex.org/W3128980175","https://openalex.org/W3174801863","https://openalex.org/W3007661461","https://openalex.org/W2964080336"],"abstract_inverted_index":{"Given":[0],"an":[1,143,177,191],"$n$-vertex":[2],"$m$-edge":[3],"graph":[4,25],"$G$":[5,13,26],"with":[6,27,75,106,151,163,185,200],"non":[7,108,152,201],"negative":[8,109,153,202],"edge-weights,":[9,110],"the":[10,15,49,60,112,129,132,149,157,164,183,198,205,212,220],"girth":[11,50,221],"of":[12,17,44,51,114,135,207,222],"is":[14],"weight":[16,45],"a":[18,34,42,101,115],"shortest":[19],"cycle":[20,43],"in":[21,39,119,127,131],"$G$.":[22,52],"For":[23],"any":[24],"polynomially":[28,186],"bounded":[29,187],"integer":[30,188],"weights,":[31,189],"we":[32,96,125,137],"present":[33],"deterministic":[35,102,180,195],"algorithm":[36,99,171],"that":[37,80],"computes,":[38],"$\\tilde{\\cal":[40,120,144,178,192],"O}(n^{5/3}+m)$-time,":[41],"at":[46,111],"most":[47],"twice":[48],"Our":[53],"approach":[54],"combines":[55],"some":[56],"new":[57],"insights":[58],"on":[59],"previous":[61],"approximation":[62,216],"algorithms":[63,141,217],"for":[64,83,104,148,182,197,218],"this":[65,170],"problem":[66],"(Lingas":[67],"and":[68,72,87,92,190],"Lundell,":[69],"IPL'09;":[70],"Roditty":[71],"Tov,":[73],"TALG'13)":[74],"Hitting":[76,166],"Set":[77,167],"based":[78,168],"methods":[79],"are":[81,160,211],"used":[82],"approximate":[84],"distance":[85],"oracles":[86],"date":[88],"back":[89],"from":[90],"(Thorup":[91],"Zwick,":[93],"JACM'05).":[94],"Then,":[95],"turn":[97],"our":[98,140,208],"into":[100,142],"$(2+\\varepsilon)$-approximation":[103],"graphs":[105,150,184,199],"arbitrary":[107],"price":[113],"slightly":[116],"worse":[117],"running-time":[118],"O}(n^{5/3}\\log^{{\\cal":[121,193],"O}(1)}{(1/\\varepsilon)}+m)$.":[122],"Finally,":[123],"if":[124],"insist":[126],"removing":[128],"dependency":[130],"number":[133],"$m$":[134],"edges,":[136],"can":[138,172],"transform":[139],"O}(n^{5/3})$-time":[145,179],"randomized":[146],"$4$-approximation":[147,181],"edge-weights":[154],"--":[155],"assuming":[156],"adjacency":[158],"lists":[159],"sorted.":[161],"Combined":[162],"aforementioned":[165],"methods,":[169],"be":[173],"derandomized,":[174],"thereby":[175],"yielding":[176],"O}(1)}{(1/\\varepsilon)})$-time":[194],"$(4+\\varepsilon)$-approximation":[196],"edge-weights.":[203],"To":[204],"best":[206],"knowledge,":[209],"these":[210],"first":[213],"known":[214],"subquadratic-time":[215],"computing":[219],"weighted":[223],"graphs.":[224]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}