{"id":"https://openalex.org/W7160872375","doi":"https://doi.org/10.48550/arxiv.2605.07523","title":"Instance and Universally Optimal Bounds for Imprecise Pareto Fronts","display_name":"Instance and Universally Optimal Bounds for Imprecise Pareto Fronts","publication_year":2026,"publication_date":"2026-05-08","ids":{"openalex":"https://openalex.org/W7160872375","doi":"https://doi.org/10.48550/arxiv.2605.07523"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.07523","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07523","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.07523","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135879564","display_name":"Sarita de Berg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Berg, Sarita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135832461","display_name":"Nynne Maria Foldager B\u00e6kke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B\u00e6kke, Nynne Maria Foldager","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135895547","display_name":"Frida Astrup Eriksen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eriksen, Frida Astrup","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135902736","display_name":"Ivor van der Hoog","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van der Hoog, Ivor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135873734","display_name":"Eva Rotenberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rotenberg, Eva","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021826063","display_name":"Daniel Rutschmann","orcid":"https://orcid.org/0009-0005-6838-2628"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rutschmann, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5670999884605408,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5670999884605408,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.1615999937057495,"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/T11106","display_name":"Data Management and Algorithms","score":0.06790000200271606,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/construct","display_name":"Construct (python library)","score":0.6413000226020813},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5810999870300293},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5307000279426575},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4887000024318695},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45840001106262207},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.39980000257492065},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.34769999980926514}],"concepts":[{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6413000226020813},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5810999870300293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5781000256538391},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5561000108718872},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5307000279426575},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5145000219345093},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4887000024318695},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45840001106262207},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.39980000257492065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35679998993873596},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.34769999980926514},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C2780876879","wikidata":"https://www.wikidata.org/wiki/Q3054749","display_name":"Meaning (existential)","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.27559998631477356},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.07523","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07523","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.07523","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07523","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,177],"the":[1,5,29,41,46,55,64,74,80,86,97,106,119,142,168,229,267,283,287,290,295],"imprecise":[2,9,60],"geometry":[3],"model,":[4],"input":[6,128,206],"is":[7,13,67,114,132,145,156,184,193,224,266],"an":[8,59,102,190,221],"point":[10,31,61,262],"set,":[11],"which":[12,162,192],"a":[14,146,164,195,210,254],"family":[15],"of":[16,58,76,88,121,167,179,198,231,239,248,285,292],"regions":[17,89,139,249],"$F":[18],"=":[19],"(R_1,":[20],"\\ldots,R_n)$,":[21],"where":[22],"for":[23,109,125,244,259,272],"each":[24],"$R_i$":[25],"one":[26],"may":[27],"retrieve":[28],"true":[30],"$p_i":[32],"\\in":[33],"R_i$.":[34],"By":[35],"preprocessing":[36,288],"$F$,":[37,250],"we":[38,219],"can":[39],"construct":[40,54,96,105],"output,":[42],"in":[43,63,69,213,228,237],"our":[44,154],"case":[45],"Pareto":[47,56,98,107],"front,":[48],"on":[49],"$P$":[50],"faster.":[51],"We":[52,100,187],"efficiently":[53],"front":[57,108],"set":[62,87,247],"plane.":[65],"Efficiency":[66],"interpreted":[68],"two":[70],"ways:":[71],"minimizing":[72],"(i)":[73],"number":[75,120,230,291],"retrievals,":[77,122,232,293],"and":[78,94,170,294],"(ii)":[79],"computation":[81],"time":[82,258],"used":[83],"to":[84,95,104,118,140,159,173,204,277],"determine":[85],"that":[90,113,124,135,153,223,243],"must":[91],"be":[92],"retrieved":[93],"front.":[99],"present":[101,189,220],"algorithm":[103,134,155,191,222,252,271],"possibly":[110],"overlapping":[111,205,273],"rectangles":[112],"\\emph{instance-optimal}":[115],"with":[116],"respect":[117],"meaning":[123,242],"every":[126],"fixed":[127,246],"$(F,":[129],"P)$,":[130],"there":[131],"no":[133,251],"retrieves":[136],"asymptotically":[137],"fewer":[138],"compute":[141],"output.":[143],"This":[144,200,265],"strong":[147],"algorithmic":[148,180],"quality,":[149],"as":[150],"it":[151],"means":[152],"competitive":[157],"even":[158],"clairvoyant":[160],"algorithms":[161],"know":[163],"correct":[165],"guess":[166],"output":[169],"only":[171,209,226],"have":[172],"verify":[174],"its":[175],"correctness.":[176],"terms":[178,238],"running":[181,214,240,257,296],"time,":[182,241,289],"instance-optimality":[183],"provably":[185],"unobtainable.":[186],"instead":[188],"within":[194],"$\\log":[196],"n$-factor":[197],"instance-optimality.":[199],"generalizes":[201],"earlier":[202],"results":[203],"regions,":[207],"at":[208],"minor":[211],"cost":[212],"time.":[215,297],"For":[216],"unit":[217],"squares,":[218],"not":[225],"instance-optimal":[227],"but":[233],"also":[234],"\\emph{universally}":[235],"optimal":[236,270],"any":[245],"has":[253],"better":[255],"worst-case":[256],"all":[260],"possible":[261],"sets":[263],"$P$.":[264],"first":[268],"universally":[269],"planar":[274],"input.":[275],"Compared":[276],"previous":[278],"work,":[279],"this":[280],"result":[281],"improves":[282],"degree":[284],"overlap,":[286]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-12T00:00:00"}