{"id":"https://openalex.org/W7162541991","doi":"https://doi.org/10.4230/lipics.socg.2026.54","title":"Approximating Pareto Sum via Bounded Monotone Min-Plus Convolution","display_name":"Approximating Pareto Sum via Bounded Monotone Min-Plus Convolution","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162541991","doi":"https://doi.org/10.4230/lipics.socg.2026.54"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25860","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.54","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.54/LIPIcs.SoCG.2026.54.pdf","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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.54/LIPIcs.SoCG.2026.54.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137104694","display_name":"Geri Gokaj","orcid":"https://orcid.org/0009-0002-7500-6848"},"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":"Gokaj, Geri","raw_affiliation_strings":["Karlsruhe Institute of Technology, Germany"],"raw_orcid":"https://orcid.org/0009-0002-7500-6848","affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088790846","display_name":"Marvin K\u00fcnnemann","orcid":"https://orcid.org/0000-0003-4813-4852"},"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":"K\u00fcnnemann, Marvin","raw_affiliation_strings":["Karlsruhe Institute of Technology, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4813-4852","affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, 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":"Storandt, Sabine","raw_affiliation_strings":["University of Konstanz, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5411-3834","affiliations":[{"raw_affiliation_string":"University of Konstanz, 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":false,"raw_author_name":"Truschel, Carina","raw_affiliation_strings":["University of Konstanz, Germany"],"raw_orcid":"https://orcid.org/0009-0009-7582-7209","affiliations":[{"raw_affiliation_string":"University of Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63296735,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3472000062465668,"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.3472000062465668,"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.2615000009536743,"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"}},{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.08049999922513962,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7245000004768372},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6057999730110168},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5722000002861023},{"id":"https://openalex.org/keywords/minkowski-addition","display_name":"Minkowski addition","score":0.5291000008583069},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.38580000400543213},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3610999882221222},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.3479999899864197}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7245000004768372},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6057999730110168},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5855000019073486},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5722000002861023},{"id":"https://openalex.org/C10233890","wikidata":"https://www.wikidata.org/wiki/Q1322294","display_name":"Minkowski addition","level":3,"score":0.5291000008583069},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4399000108242035},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3885999917984009},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.38580000400543213},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3610999882221222},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3091999888420105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30489999055862427},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C118127601","wikidata":"https://www.wikidata.org/wiki/Q3797610","display_name":"Pareto analysis","level":3,"score":0.2996000051498413},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.26910001039505005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25220000743865967},{"id":"https://openalex.org/C190373308","wikidata":"https://www.wikidata.org/wiki/Q837683","display_name":"Pareto distribution","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25860","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.54","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.54/LIPIcs.SoCG.2026.54.pdf","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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.54","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.54","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25860","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.54","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.54/LIPIcs.SoCG.2026.54.pdf","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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162541991.pdf","grobid_xml":"https://content.openalex.org/works/W7162541991.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,24],"Pareto":[1,30,44,81,111,119,157,170],"sum":[2,31,45],"of":[3,17,26,46,51,94,108,192,233],"two-dimensional":[4],"point":[5],"sets":[6,47,112,171],"P":[7,48],"and":[8,49,86,113,184,241],"Q":[9,50],"in":[10,20,34,84,199,223],"\u211d\u00b2":[11],"is":[12,71,121],"defined":[13],"as":[14],"the":[15,18,29,43,68,91,95,101,135,160,190,193,209,250],"skyline":[16],"points":[19],"their":[21],"Minkowski":[22],"sum.":[23],"problem":[25,137],"efficiently":[27,77],"computing":[28,42,116,156],"arises":[32],"frequently":[33],"bi-criteria":[35],"optimization":[36],"algorithms.":[37],"Prior":[38],"work":[39],"establishes":[40],"that":[41,59,115],"size":[52,70,187],"n":[53],"suffers":[54],"from":[55],"conditional":[56],"lower":[57],"bounds":[58],"rule":[60],"out":[61],"strongly":[62,148],"subquadratic":[63,149,231],"O(n^{2-\u03b5})-time":[64],"algorithms,":[65],"even":[66,219],"when":[67],"output":[69],"\u0398(n).":[72],"Naturally,":[73],"we":[74,79,89,104,144,163,225],"ask:":[75],"How":[76],"can":[78],"approximate":[80,110,118],"sums,":[82],"both":[83],"theory":[85],"practice?":[87],"Can":[88],"beat":[90],"near-quadratic-time":[92],"state":[93,191],"art":[96,194],"for":[97,134,155,168,195,220],"exact":[98,196],"algorithms?":[99],"On":[100,159],"theoretical":[102],"side,":[103,162],"formulate":[105],"a":[106,130,147,178,227],"notion":[107],"additively":[109],"show":[114],"an":[117,234],"set":[120],"fine-grained":[122],"equivalent":[123],"to":[124,189,212,237],"Bounded":[125,213],"Monotone":[126,214],"Min-Plus":[127,215],"Convolution.":[128],"Leveraging":[129],"remarkable":[131],"O\u0303(n^{1.5})-time":[132],"algorithm":[133,154,235],"latter":[136],"(Chi,":[138],"Duan,":[139,239],"Xie,":[140],"Zhang;":[141],"STOC":[142],"'22),":[143],"thus":[145],"obtain":[146],"(and":[150],"conditionally":[151],"optimal)":[152],"approximation":[153,182],"sums.":[158],"practical":[161],"engineer":[164],"different":[165],"algorithmic":[166],"approaches":[167],"approximating":[169],"on":[172,244],"realistic":[173],"instances.":[174],"Our":[175],"implementations":[176],"enable":[177],"granular":[179],"trade-off":[180],"between":[181],"quality":[183],"running":[185],"time/output":[186],"compared":[188],"algorithms":[197],"established":[198],"(Funke,":[200],"Hespe,":[201],"Sanders,":[202],"Storandt,":[203],"Truschel;":[204],"Algorithmica":[205],"'25).":[206],"Perhaps":[207],"surprisingly,":[208],"(theoretical)":[210],"connection":[211],"Convolution":[216],"remains":[217],"beneficial":[218],"our":[221],"implementations:":[222],"particular,":[224],"implement":[226],"simplified,":[228],"yet":[229],"still":[230],"version":[232],"due":[236],"Chi,":[238],"Xie":[240],"Zhang,":[242],"which":[243],"some":[245],"sufficiently":[246],"large":[247],"instances":[248],"outperforms":[249],"competing":[251],"quadratic-time":[252],"approaches.":[253]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}