{"id":"https://openalex.org/W4376639498","doi":"https://doi.org/10.1145/3564246.3585146","title":"A PTAS for Minimizing Weighted Flow Time on a Single Machine","display_name":"A PTAS for Minimizing Weighted Flow Time on a Single Machine","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639498","doi":"https://doi.org/10.1145/3564246.3585146"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585146","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cris.maastrichtuniversity.nl/en/publications/021e148b-5afa-4b39-9d8a-f33e2a409c0f","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077840433","display_name":"Alexander Armbruster","orcid":"https://orcid.org/0009-0004-6826-398X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Armbruster","raw_affiliation_strings":["TU Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Munich, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074555680","display_name":"Lars Rohwedder","orcid":"https://orcid.org/0000-0002-9434-4589"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Lars Rohwedder","raw_affiliation_strings":["Maastricht University, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maastricht University, Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas Wiese","raw_affiliation_strings":["TU Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Munich, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1881,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54006373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1335","last_page":"1344"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9901000261306763,"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/time-complexity","display_name":"Time complexity","score":0.7372778654098511},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.626125693321228},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5710337162017822},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5602300763130188},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5281681418418884},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5079188942909241},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5040556192398071},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49550187587738037},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.48830723762512207},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44764092564582825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4411300718784332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43906983733177185},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.43210574984550476},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4319623112678528},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37847816944122314},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36256158351898193}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7372778654098511},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.626125693321228},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5710337162017822},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5602300763130188},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5281681418418884},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5079188942909241},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5040556192398071},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49550187587738037},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.48830723762512207},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44764092564582825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4411300718784332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43906983733177185},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.43210574984550476},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4319623112678528},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37847816944122314},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36256158351898193},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3564246.3585146","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/021e148b-5afa-4b39-9d8a-f33e2a409c0f","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/021e148b-5afa-4b39-9d8a-f33e2a409c0f","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Armbruster, A, Rohwedder, L & Wiese, A 2023, A PTAS for Minimizing Weighted Flow Time on a Single Machine. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1335-1344, 55th Annual ACM Symposium on Theory of Computing, Orlando, Florida, United States, 20/06/23. https://doi.org/10.1145/3564246.3585146","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/021e148b-5afa-4b39-9d8a-f33e2a409c0f","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85163086450","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Armbruster, A, Rohwedder, L & Wiese, A 2023, A PTAS for Minimizing Weighted Flow Time on a Single Machine. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1335-1344, 55th Annual ACM Symposium on Theory of Computing, Orlando, Florida, United States, 20/06/23. https://doi.org/10.1145/3564246.3585146","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:publications/021e148b-5afa-4b39-9d8a-f33e2a409c0f","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85163086450&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Armbruster, A, Rohwedder, L & Wiese, A 2023, A PTAS for Minimizing Weighted Flow Time on a Single Machine. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1335-1344, 55th Annual ACM Symposium on Theory of Computing, Orlando, Florida, United States, 20/06/23. https://doi.org/10.1145/3564246.3585146","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/021e148b-5afa-4b39-9d8a-f33e2a409c0f","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/021e148b-5afa-4b39-9d8a-f33e2a409c0f","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Armbruster, A, Rohwedder, L & Wiese, A 2023, A PTAS for Minimizing Weighted Flow Time on a Single Machine. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1335-1344, 55th Annual ACM Symposium on Theory of Computing, Orlando, Florida, United States, 20/06/23. https://doi.org/10.1145/3564246.3585146","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G8410575223","display_name":"The Twilight Zone of Efficiency: Optimality of Quasi-Polynomial Time Algorithms","funder_award_id":"OCENW.M.21.268","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1528157682","https://openalex.org/W1970286891","https://openalex.org/W2020082371","https://openalex.org/W2086365412","https://openalex.org/W2133663637","https://openalex.org/W2134553994","https://openalex.org/W2166867051","https://openalex.org/W2570727021","https://openalex.org/W2743045177","https://openalex.org/W2889246377","https://openalex.org/W2952691133","https://openalex.org/W2962679017","https://openalex.org/W2964063620","https://openalex.org/W3168487205"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2962917430","https://openalex.org/W2048358792","https://openalex.org/W2028468530","https://openalex.org/W1906268133","https://openalex.org/W2620541949","https://openalex.org/W1903284337","https://openalex.org/W1972853793","https://openalex.org/W2399100966","https://openalex.org/W2009846993"],"abstract_inverted_index":{"An":[0],"important":[1],"objective":[2],"function":[3],"in":[4],"the":[5,11,53,56,61,64,71,89,103,116,125,129,140,152],"scheduling":[6],"literature":[7],"is":[8,27,41,70,91],"to":[9,42],"minimize":[10],"sum":[12,54],"of":[13,22,55,60,67],"weighted":[14,57],"flow":[15,58,65],"times.":[16],"We":[17],"are":[18],"given":[19],"a":[20,30,33,37,44,48,68,92,143,155],"set":[21],"jobs,":[23,62],"where":[24,63],"each":[25],"job":[26,69],"characterized":[28],"by":[29,94,107,131],"release":[31,79],"time,":[32,35],"processing":[34],"and":[36,77,96,110,127,134],"weight.":[38],"Our":[39],"goal":[40],"find":[43],"preemptive":[45],"schedule":[46],"on":[47,102,128],"single":[49],"machine":[50],"that":[51],"minimizes":[52],"times":[59],"time":[66,72,76,86,119,145],"between":[73],"its":[74,78],"completion":[75],"time.":[80],"The":[81],"currently":[82],"best":[83],"known":[84],"polynomial":[85,144],"algorithm":[87,123],"for":[88,124],"problem":[90,153],"(2+\u0454)-approximation":[93],"Rohwedder":[95],"Wiese":[97],"[STOC":[98],"2021],":[99],"which":[100],"builds":[101],"prior":[104],"break-through":[105],"result":[106,130],"Batra,":[108],"Garg,":[109],"Kumar":[111],"[FOCS":[112],"2018]":[113],"who":[114,138],"found":[115],"first":[117],"pseudo-polynomial":[118],"constant":[120],"factor":[121],"approximation":[122],"problem,":[126],"Feige,":[132],"Kulkarni,":[133],"Li":[135],"[SODA":[136],"2019]":[137],"turned":[139],"latter":[141],"into":[142],"algorithm.":[146],"However,":[147],"it":[148],"remains":[149],"open":[150],"whether":[151],"admits":[154],"PTAS.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}