{"id":"https://openalex.org/W4281744954","doi":"https://doi.org/10.1145/3519935.3519959","title":"A PTAS for unsplittable flow on a path","display_name":"A PTAS for unsplittable flow on a path","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281744954","doi":"https://doi.org/10.1145/3519935.3519959"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3519959","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I15196421","display_name":"University of Applied Sciences and Arts of Southern Switzerland","ror":"https://ror.org/05ep8g269","country_code":"CH","type":"education","lineage":["https://openalex.org/I15196421"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["USI-SUPSI, Switzerland"],"affiliations":[{"raw_affiliation_string":"USI-SUPSI, Switzerland","institution_ids":["https://openalex.org/I15196421"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041355842","display_name":"Tobias M\u00f6mke","orcid":"https://orcid.org/0000-0002-2509-6972"},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias M\u00f6mke","raw_affiliation_strings":["University of Augsburg, Germany"],"affiliations":[{"raw_affiliation_string":"University of Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Andreas Wiese","raw_affiliation_strings":["Vrije Universiteit Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Netherlands","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034276567"],"corresponding_institution_ids":["https://openalex.org/I15196421"],"apc_list":null,"apc_paid":null,"fwci":0.7541,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73720795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"289","last_page":"302"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.6383118629455566},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6374742984771729},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5971881151199341},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5438123941421509},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46718719601631165},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4607705771923065},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4407426416873932},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36130291223526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17628905177116394},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09554320573806763},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07140380144119263}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6383118629455566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6374742984771729},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5971881151199341},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5438123941421509},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46718719601631165},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4607705771923065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4407426416873932},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36130291223526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17628905177116394},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09554320573806763},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07140380144119263},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3519935.3519959","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/a4072292-fc55-4cc1-ac67-23b028ed9571","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/a4072292-fc55-4cc1-ac67-23b028ed9571","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Grandoni, F, M\u00f6mke, T & Wiese, A 2022, A PTAS for unsplittable flow on a path. in S Leonardi & A Gupta (eds), STOC 2022 : Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 289-302, 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, Rome, Italy, 20/06/22. https://doi.org/10.1145/3519935.3519959","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:108428","is_oa":false,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/108428","pdf_url":null,"source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conferenceobject"},{"id":"pmh:vu:oai:research.vu.nl:publications/a4072292-fc55-4cc1-ac67-23b028ed9571","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/a4072292-fc55-4cc1-ac67-23b028ed9571","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 289 - 302","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W146916075","https://openalex.org/W174940708","https://openalex.org/W1507141328","https://openalex.org/W1604629374","https://openalex.org/W1846413446","https://openalex.org/W1996971123","https://openalex.org/W1998375208","https://openalex.org/W2005960287","https://openalex.org/W2015840394","https://openalex.org/W2040756373","https://openalex.org/W2049033541","https://openalex.org/W2069417991","https://openalex.org/W2096347791","https://openalex.org/W2103363383","https://openalex.org/W2170344325","https://openalex.org/W2175156623","https://openalex.org/W2290717180","https://openalex.org/W2292671995","https://openalex.org/W2406451287","https://openalex.org/W2503761073","https://openalex.org/W2504092734","https://openalex.org/W2742062324","https://openalex.org/W2809199312","https://openalex.org/W2964209463","https://openalex.org/W2978368104","https://openalex.org/W3037577501","https://openalex.org/W3197802126","https://openalex.org/W3197971022","https://openalex.org/W3209212021","https://openalex.org/W4206057775","https://openalex.org/W4235331094","https://openalex.org/W4237140089","https://openalex.org/W4247372595","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2052899165","https://openalex.org/W2008562718","https://openalex.org/W1495971547","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1774334694","https://openalex.org/W1903284337"],"abstract_inverted_index":{"In":[0,144],"the":[1,50,54,64,109],"Unsplittable":[2],"Flow":[3],"on":[4],"a":[5,12,18,28,30,33,40,71,85,142,154],"Path":[6],"problem":[7,69,140],"(UFP)":[8],"we":[9,147],"are":[10],"given":[11],"path":[13],"with":[14],"edge":[15,59],"capacities,":[16],"and":[17,32,152],"set":[19],"of":[20,42,44,53,66,88,122],"tasks":[21,43,56],"where":[22],"each":[23,58],"task":[24],"is":[25,37,61],"characterized":[26],"by":[27],"subpath,":[29],"demand,":[31],"weight.":[34],"The":[35,68],"goal":[36],"to":[38],"select":[39],"subset":[41],"maximum":[45],"total":[46,51],"weight":[47],"such":[48],"that":[49],"demand":[52],"selected":[55],"using":[57],"e":[60],"at":[62],"most":[63],"capacity":[65],"e.":[67],"admits":[70,141],"QPTAS":[72],"[Bansal,":[73,90],"Chakrabarti,":[74],"Epstein,":[75],"Schieber,":[76],"STOC'06;":[77],"Batra,":[78],"Garg,":[79],"Kumar,":[80],"M\u00f6mke,":[81,105,129],"Wiese,":[82,97,102,106,130],"SODA'15].":[83],"After":[84],"long":[86],"sequence":[87],"improvements":[89],"Friggstad,":[91],"Khandekar,":[92],"Salavatipour,":[93],"SODA'09;":[94],"Bonsma,":[95],"Schulz,":[96],"FOCS'11;":[98],"Anagnostopoulos,":[99],"Grandoni,":[100,104],"Leonardi,":[101],"SODA'14;":[103],"Zhou,":[107],"STOC'18],":[108],"best":[110],"known":[111],"polynomial":[112,155],"time":[113,156],"approximation":[114,120],"algorithm":[115,160],"for":[116,161],"UFP":[117],"has":[118,133],"an":[119,135],"ratio":[121],"1+1/(e+1)":[123],"+":[124,158],"epsilon":[125],"<":[126],"1.269":[127],"[Grandoni,":[128],"SODA'22].":[131],"It":[132],"been":[134],"open":[136,150],"question":[137,151],"whether":[138],"this":[139,145,149],"PTAS.":[143],"paper,":[146],"solve":[148],"present":[153],"(1":[157],"epsilon)-approximation":[159],"UFP.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T08:04:53.788161","created_date":"2025-10-10T00:00:00"}