{"id":"https://openalex.org/W4416019961","doi":"https://doi.org/10.1145/3798129.3800892","title":"Randomized Rounding over Dynamic Programs","display_name":"Randomized Rounding over Dynamic Programs","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416019961","doi":"https://doi.org/10.1145/3798129.3800892"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800892","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800892","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007470040","display_name":"\u00c9tienne Bamas","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"\u00c9tienne Bamas","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0009-0001-9316-4631","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100430767","display_name":"Shi Li","orcid":"https://orcid.org/0000-0001-9769-1191"},"institutions":[{"id":"https://openalex.org/I119454577","display_name":"Nanjing Agricultural University","ror":"https://ror.org/05td3s095","country_code":"CN","type":"education","lineage":["https://openalex.org/I119454577"]},{"id":"https://openalex.org/I134687103","display_name":"Nanjing Tech University","ror":"https://ror.org/03sd35x91","country_code":"CN","type":"education","lineage":["https://openalex.org/I134687103"]},{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shi Li","raw_affiliation_strings":["Nanjing University, Nanjing City, China"],"raw_orcid":"https://orcid.org/0000-0001-9140-9415","affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing City, China","institution_ids":["https://openalex.org/I881766915","https://openalex.org/I119454577","https://openalex.org/I134687103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074555680","display_name":"Lars Rohwedder","orcid":"https://orcid.org/0000-0002-9434-4589"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Rohwedder","raw_affiliation_strings":["University of Southern Denmark, Odense, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-9434-4589","affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.02754888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1857","last_page":"1868"},"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.9075000286102295,"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.9075000286102295,"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.012199999764561653,"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/T12176","display_name":"Optimization and Packing Problems","score":0.009499999694526196,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7357000112533569},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7342000007629395},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6726999878883362},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6383000016212463},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6310999989509583},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5386000275611877},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.499099999666214},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48350000381469727}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7357000112533569},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7342000007629395},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6726999878883362},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6383000016212463},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6310999989509583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5841000080108643},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5386000275611877},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5212000012397766},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.499099999666214},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48350000381469727},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4634999930858612},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4555000066757202},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42179998755455017},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.40540000796318054},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3727000057697296},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3617999851703644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3596000075340271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32710000872612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32010000944137573},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2718000113964081}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800892","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2511.03490","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.03490","pdf_url":"https://arxiv.org/pdf/2511.03490","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"doi:10.48550/arxiv.2511.03490","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.03490","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"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800892","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2549064112","display_name":null,"funder_award_id":"101220563","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"under":[3,23],"mild":[4],"assumptions":[5],"for":[6,105],"a":[7,12,21,59,75,98,115,126],"problem":[8,46],"whose":[9],"solutions":[10,57],"admit":[11],"dynamic":[13,52],"programming-like":[14],"recurrence":[15],"relation,":[16],"we":[17,49,73,81,113],"can":[18,38],"still":[19],"find":[20],"solution":[22],"additional":[24,36],"packing":[25,91],"constraints,":[26],"which":[27,80],"need":[28],"to":[29],"be":[30,39],"satisfied":[31],"approximately.":[32],"The":[33],"number":[34],"of":[35,97],"constraints":[37,92],"very":[40],"large,":[41],"e.g.,":[42,67],"polynomial":[43,131],"in":[44,102,118,130],"the":[45,51,68,90,95],"size.":[47],"Technically,":[48],"reinterpret":[50],"programming":[53],"subproblems":[54],"and":[55],"their":[56],"as":[58,125],"network":[60],"design":[61],"problem.":[62],"Inspired":[63],"by":[64,122],"techniques":[65],"from,":[66],"Directed":[69],"Steiner":[70],"Tree":[71],"problem,":[72],"construct":[74],"strong":[76],"LP":[77],"relaxation,":[78],"on":[79,89],"then":[82],"apply":[83],"randomized":[84],"rounding.":[85],"Our":[86],"approximation":[87,117],"guarantees":[88],"have":[93],"roughly":[94],"form":[96],"(n\u0454":[99],"polylog":[100],"n)-approximation":[101],"time":[103],"nO(1/\u0454),":[104],"any":[106],"\u0454":[107,124],">":[108],"0.":[109],"By":[110],"setting":[111,123],"\u0454=loglogn/logn,":[112],"obtain":[114],"polylogarithmic":[116],"quasi-polynomial":[119],"time,":[120],"or":[121],"constant,":[127],"an":[128],"n\u0454-approximation":[129],"time.":[132]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-07T00:00:00"}