{"id":"https://openalex.org/W4409864134","doi":"https://doi.org/10.1007/s00453-025-01314-y","title":"Pareto Sums of Pareto Sets: Lower Bounds and Algorithms","display_name":"Pareto Sums of Pareto Sets: Lower Bounds and Algorithms","publication_year":2025,"publication_date":"2025-04-28","ids":{"openalex":"https://openalex.org/W4409864134","doi":"https://doi.org/10.1007/s00453-025-01314-y","pmid":"https://pubmed.ncbi.nlm.nih.gov/40838096"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01314-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01314-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01314-y.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01314-y.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087445811","display_name":"Daniel Funke","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Funke","raw_affiliation_strings":["KIT, Am Fasanengarten, Karlsruhe, 76128 Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KIT, Am Fasanengarten, Karlsruhe, 76128 Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088448220","display_name":"Demian Hespe","orcid":"https://orcid.org/0000-0001-6232-2951"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Demian Hespe","raw_affiliation_strings":["KIT, Am Fasanengarten, Karlsruhe, 76128 Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KIT, Am Fasanengarten, Karlsruhe, 76128 Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Sanders","raw_affiliation_strings":["KIT, Am Fasanengarten, Karlsruhe, 76128 Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KIT, Am Fasanengarten, Karlsruhe, 76128 Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027517542","display_name":"Sabine Storandt","orcid":"https://orcid.org/0000-0001-5411-3834"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sabine Storandt","raw_affiliation_strings":["University of Konstanz, Universit\u00e4tsstra\u00dfe, Konstanz, 78464 Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Konstanz, Universit\u00e4tsstra\u00dfe, Konstanz, 78464 Germany","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114386440","display_name":"Carina Truschel","orcid":null},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Carina Truschel","raw_affiliation_strings":["University of Konstanz, Universit\u00e4tsstra\u00dfe, Konstanz, 78464 Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Konstanz, Universit\u00e4tsstra\u00dfe, Konstanz, 78464 Germany","institution_ids":["https://openalex.org/I189712700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5114386440"],"corresponding_institution_ids":["https://openalex.org/I189712700"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":4.8696,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.94918076,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"87","issue":"8","first_page":"1111","last_page":"1144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9860000014305115,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9793000221252441,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/pareto-principle","display_name":"Pareto principle","score":0.7296853065490723},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7151291370391846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5463864803314209},{"id":"https://openalex.org/keywords/pareto-interpolation","display_name":"Pareto interpolation","score":0.5286306142807007},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.520497739315033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49817657470703125},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4775208532810211},{"id":"https://openalex.org/keywords/pareto-analysis","display_name":"Pareto analysis","score":0.4677227735519409},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3981740176677704},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.36447885632514954},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35349729657173157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35127806663513184},{"id":"https://openalex.org/keywords/generalized-pareto-distribution","display_name":"Generalized Pareto distribution","score":0.1446041762828827},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10571616888046265}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7296853065490723},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7151291370391846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5463864803314209},{"id":"https://openalex.org/C38814450","wikidata":"https://www.wikidata.org/wiki/Q7136870","display_name":"Pareto interpolation","level":4,"score":0.5286306142807007},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.520497739315033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49817657470703125},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4775208532810211},{"id":"https://openalex.org/C118127601","wikidata":"https://www.wikidata.org/wiki/Q3797610","display_name":"Pareto analysis","level":3,"score":0.4677227735519409},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3981740176677704},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.36447885632514954},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35349729657173157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35127806663513184},{"id":"https://openalex.org/C133514767","wikidata":"https://www.wikidata.org/wiki/Q5532448","display_name":"Generalized Pareto distribution","level":3,"score":0.1446041762828827},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10571616888046265},{"id":"https://openalex.org/C147581598","wikidata":"https://www.wikidata.org/wiki/Q729429","display_name":"Extreme value theory","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-025-01314-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01314-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01314-y.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmid:40838096","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/40838096","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":null},{"id":"pmh:oai:pubmedcentral.nih.gov:12361342","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/12361342","pdf_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC12361342/pdf/453_2025_Article_1314.pdf","source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"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":"Algorithmica","raw_type":"Text"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/73335","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-2-arqe1zcx179c7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"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":"Algorithmica. Springer. 2025, 87(8), S. 1111-1144. ISSN 0178-4617. eISSN 1432-0541. Verf\u00fcgbar unter: doi: 10.1007/s00453-025-01314-y","raw_type":"doc-type:Text"}],"best_oa_location":{"id":"doi:10.1007/s00453-025-01314-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01314-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01314-y.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4926056139","display_name":null,"funder_award_id":"251654672 \u2013 TRR 161","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8592370410","display_name":null,"funder_award_id":"882500","funder_id":"https://openalex.org/F4320338453","funder_display_name":"HORIZON EUROPE European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320326505","display_name":"Universit\u00e4t Konstanz","ror":"https://ror.org/0546hnb39"},{"id":"https://openalex.org/F4320338453","display_name":"HORIZON EUROPE European Research Council","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409864134.pdf","grobid_xml":"https://content.openalex.org/works/W4409864134.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W86593919","https://openalex.org/W1872114527","https://openalex.org/W1967241124","https://openalex.org/W1972508246","https://openalex.org/W1978520433","https://openalex.org/W1985461988","https://openalex.org/W1991365862","https://openalex.org/W1992963068","https://openalex.org/W2021335272","https://openalex.org/W2049864887","https://openalex.org/W2075587380","https://openalex.org/W2083743691","https://openalex.org/W2118625817","https://openalex.org/W2127895666","https://openalex.org/W2137619903","https://openalex.org/W2290289666","https://openalex.org/W2404199818","https://openalex.org/W2593213569","https://openalex.org/W2767528495","https://openalex.org/W2805569781","https://openalex.org/W2911302472","https://openalex.org/W2912502303","https://openalex.org/W3125825223","https://openalex.org/W3198580319","https://openalex.org/W4206965649","https://openalex.org/W4294724937","https://openalex.org/W4382866737","https://openalex.org/W4384007717","https://openalex.org/W4389513548"],"related_works":["https://openalex.org/W2337862504","https://openalex.org/W1973015798","https://openalex.org/W1973407216","https://openalex.org/W2090178682","https://openalex.org/W4323346143","https://openalex.org/W4412908058","https://openalex.org/W2331058224","https://openalex.org/W2060580252","https://openalex.org/W317165722","https://openalex.org/W2503323040"],"abstract_inverted_index":{"Abstract":[0],"In":[1,41],"bi-criteria":[2,448],"optimization":[3],"problems,":[4],"the":[5,11,38,46,50,74,106,123,131,219,225,305,355,400,421,458,462,467,488],"goal":[6,132],"is":[7,133,457],"typically":[8],"to":[9,134,139,229,404,419,482,494],"compute":[10,135,140],"set":[12],"of":[13,21,29,34,48,53,61,73,112,144,166,191,221,378,425],"Pareto-optimal":[14],"solutions.":[15],"Many":[16],"algorithms":[17,151,475,495],"for":[18,152,205,264,292,317,335,409],"these":[19],"types":[20],"problems":[22],"rely":[23],"on":[24,436],"efficient":[25,153],"merging":[26],"or":[27],"combining":[28],"partial":[30],"solutions":[31,36],"and":[32,141,187,374,438,465,486,490],"filtering":[33],"dominated":[35],"in":[37,272,451,461,466],"resulting":[39],"sets.":[40],"this":[42,314],"article,":[43],"we":[44,258,364,414,429,445],"consider":[45,446],"task":[47,460],"computing":[49],"Pareto":[51,56,66,124,154,265,454],"sum":[52,67,76,108,125,155,266,455],"two":[54],"given":[55],"sets":[57],"A":[58],",":[59,121,257,354,397],"B":[60],"size":[62,111],"n":[63,170],".":[64,104,146,217,241,333,412,500],"The":[65,310],"C":[68,126,136,222],"contains":[69],"all":[70,143],"non-dominated":[71],"points":[72],"Minkowski":[75,107],"$$M":[77],"=":[78],"\\{a+b|a":[79],"\\in":[80,319,337],"A,":[81],"b\\in":[82],"B\\}$$":[83],"<mml:math":[84,114,173,194,207,232,248,276,296,322,340,383],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[85,115,174,195,208,233,249,277,297,323,341,384],"<mml:mrow>":[86,175,196,209,234,250,278,283,298,324,342,385],"<mml:mi>M</mml:mi>":[87],"<mml:mo>=</mml:mo>":[88,211],"<mml:mo>{</mml:mo>":[89],"<mml:mi>a</mml:mi>":[90,94],"<mml:mo>+</mml:mo>":[91,181,200],"<mml:mi>b</mml:mi>":[92,98],"<mml:mo>|</mml:mo>":[93,212,214],"<mml:mo>\u2208</mml:mo>":[95,99,326,344],"<mml:mi>A</mml:mi>":[96],"<mml:mo>,</mml:mo>":[97],"<mml:mi>B</mml:mi>":[100],"<mml:mo>}</mml:mo>":[101],"</mml:mrow>":[102,185,203,215,239,255,287,290,302,331,352,395],"</mml:math>":[103,120,186,204,216,240,256,291,303,332,353,396],"Since":[105],"has":[109],"a":[110,163,188,260,359,375,405,442],"$$n^2$$":[113],"<mml:msup>":[116,281,347,388],"<mml:mi>n</mml:mi>":[117,178,180,182,199,237,254,282,329,348,389,393],"<mml:mn>2</mml:mn>":[118,253,284,349,390],"</mml:msup>":[119,288,350,391],"but":[122],"can":[127],"be":[128],"much":[129],"smaller,":[130],"without":[137],"having":[138],"store":[142,498],"M":[145,499],"We":[147,470],"present":[148,366],"several":[149],"new":[150],"computation,":[156,267],"including":[157],"an":[158,367,370,431,477],"output-sensitive":[159,371,478],"successive":[160,311,356],"algorithm":[161,312,357,368],"with":[162,369,476],"running":[164,270,361,376,423],"time":[165,377,492],"$$\\mathcal":[167,192,230,273,379],"{O}(n":[168],"\\log":[169,381],"+":[171],"nk)$$":[172],"<mml:mi>O</mml:mi>":[176,197,235,279,386],"<mml:mo>(</mml:mo>":[177,198,236,280,328,346,387],"<mml:mo>log</mml:mo>":[179,392],"<mml:mi>k</mml:mi>":[183,201,210,251,325,343],"<mml:mo>)</mml:mo>":[184,202,238,289,330,351,394],"space":[189,226,372,479],"consumption":[190,227,373,480],"{O}(n+k)$$":[193],"$$k=|C|$$":[206],"<mml:mi>C</mml:mi>":[213],"If":[218],"elements":[220],"are":[223],"streamed,":[224],"reduces":[228,487],"{O}(n)$$":[231],"For":[242],"output":[243],"sizes":[244],"$$k":[245,318,336],"\\ge":[246],"2n$$":[247],"<mml:mo>\u2265</mml:mo>":[252],"prove":[259],"conditional":[261],"lower":[262,315,401],"bound":[263,316,402],"which":[268,398],"excludes":[269],"times":[271,424],"{O}(n^{2-\\delta":[274],"})$$":[275],"<mml:mo>-</mml:mo>":[285],"<mml:mi>\u03b4</mml:mi>":[286,299],"$$\\delta":[293],"&gt;":[294],"0$$":[295],"<mml:mo>&gt;</mml:mo>":[300],"<mml:mn>0</mml:mn>":[301],"unless":[304],"(min,+)-convolution":[306],"hardness":[307],"conjecture":[308],"fails.":[309],"matches":[313,399],"\\Theta":[320,338],"(n)$$":[321],"<mml:mi>\u0398</mml:mi>":[327,345],"However,":[334],"(n^2)$$":[339],"exhibits":[358],"cubic":[360],"time.":[362],"But":[363],"also":[365],"{O}(n^2":[380],"n)$$":[382],"up":[403],"logarithmic":[406],"factor":[407],"even":[408],"large":[410],"k":[411],"Furthermore,":[413],"describe":[415],"suitable":[416],"engineering":[417],"techniques":[418],"improve":[420],"practical":[422],"our":[426,474],"algorithms.":[427],"Finally,":[428],"provide":[430],"extensive":[432],"comparative":[433],"experimental":[434],"study":[435],"generated":[437],"real-world":[439],"data.":[440],"As":[441],"showcase":[443],"application,":[444],"preprocessing-based":[447],"route":[449],"planning":[450],"road":[452],"networks.":[453],"computation":[456],"bottleneck":[459],"preprocessing":[463,489],"phase":[464],"query":[468,491],"phase.":[469],"show":[471],"that":[472,496],"using":[473],"allows":[481],"tackle":[483],"larger":[484],"instances":[485],"compared":[493],"fully":[497]},"counts_by_year":[{"year":2025,"cited_by_count":5}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}