{"id":"https://openalex.org/W4281886990","doi":"https://doi.org/10.1145/3519935.3520077","title":"Flow time scheduling and prefix Beck-Fiala","display_name":"Flow time scheduling and prefix Beck-Fiala","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281886990","doi":"https://doi.org/10.1145/3519935.3520077"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520077","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520077","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/297247","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"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/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"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":"Ola Svensson","raw_affiliation_strings":["EPFL, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"331","last_page":"342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9688000082969666,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6738297939300537},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6155282855033875},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4903102219104767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48599013686180115},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.475182443857193},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47426068782806396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4737088084220886},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.473201721906662},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47306573390960693},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40787985920906067},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29271751642227173},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07241705060005188}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6738297939300537},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6155282855033875},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4903102219104767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48599013686180115},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.475182443857193},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47426068782806396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4737088084220886},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.473201721906662},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47306573390960693},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40787985920906067},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29271751642227173},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07241705060005188},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3519935.3520077","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520077","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:cris.maastrichtuniversity.nl:openaire/926e3268-5d88-46b6-b702-885168659d05","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/926e3268-5d88-46b6-b702-885168659d05","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Rohwedder, L & Svensson, O 2022, Flow Time Scheduling and Prefix Beck-Fiala. in S Leonardi & A Gupta (eds), Proceedings of the 54th annual ACM SIGACT symposium on theory of computing (STOC '22). The Association for Computing Machinery, Annual ACM Symposium on Theory of Computing, pp. 331-342, 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), Rome, Italy, 20/06/22. https://doi.org/10.1145/3519935.3520077","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:infoscience.epfl.ch:297247","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/297247","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/297247","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:297247","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/297247","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/297247","raw_type":"Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4405413375","display_name":"Continuous Methods in Discrete Optimization","funder_award_id":"639.023.812","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":16,"referenced_works":["https://openalex.org/W1559482660","https://openalex.org/W1603330095","https://openalex.org/W1998136934","https://openalex.org/W2000105188","https://openalex.org/W2035339061","https://openalex.org/W2080024126","https://openalex.org/W2080064821","https://openalex.org/W2100283019","https://openalex.org/W2102201348","https://openalex.org/W2140322654","https://openalex.org/W2149178517","https://openalex.org/W2493844837","https://openalex.org/W2551238896","https://openalex.org/W2942921462","https://openalex.org/W3001841464","https://openalex.org/W3088300790"],"related_works":["https://openalex.org/W2142481367","https://openalex.org/W3196321793","https://openalex.org/W3080705045","https://openalex.org/W2385527937","https://openalex.org/W2005880840","https://openalex.org/W2507465767","https://openalex.org/W4385305499","https://openalex.org/W2047674875","https://openalex.org/W4245066656","https://openalex.org/W2373597927"],"abstract_inverted_index":{"We":[0],"relate":[1],"discrepancy":[2,32,104],"theory":[3],"with":[4,54],"the":[5,35,44,82,93,96,142,157],"classic":[6],"scheduling":[7],"problems":[8],"of":[9,47,66,86,102,162],"minimizing":[10],"max":[11,72,128],"flow":[12,16,45,73,77,129,133],"time":[13,17,46,74,130],"and":[14,68,75,88,131],"total":[15,76,132],"on":[18,43,109],"unrelated":[19],"machines.":[20],"Specifically,":[21],"we":[22,148],"give":[23,64],"a":[24,55],"general":[25,159],"reduction":[26,53,97],"that":[27,150],"allows":[28],"us":[29],"to":[30,41,154,156],"transfer":[31,155],"bounds":[33,42],"in":[34,146],"prefix":[36,103,110],"Beck-Fiala":[37,111],"(bounded":[38],"\u21131-norm)":[39],"setting":[40],"an":[48],"optimal":[49],"schedule.":[50],"Combining":[51],"our":[52],"deep":[56],"result":[57],"proved":[58],"by":[59],"Banaszczyk":[60],"via":[61],"convex":[62],"geometry,":[63],"guarantees":[65,85,125],"O(\u221alogn)":[67],"O(\u221alogn":[69],"logP)":[70],"for":[71,126],"time,":[78],"respectively,":[79],"improving":[80],"upon":[81],"previous":[83],"best":[84],"O(logn)":[87],"O(logn":[89],"logP).":[90],"Apart":[91],"from":[92],"improved":[94],"guarantees,":[95],"motivates":[98],"seemingly":[99],"easy":[100],"versions":[101],"questions:":[105],"any":[106],"constant":[107],"bound":[108],"where":[112],"vectors":[113],"have":[114],"sparsity":[115],"two":[116],"(sparsity":[117],"one":[118],"being":[119],"trivial)":[120],"would":[121],"already":[122],"yield":[123],"tight":[124],"both":[127],"time.":[134],"While":[135],"known":[136],"techniques":[137],"solve":[138],"this":[139],"case":[140,161],"when":[141],"entries":[143],"take":[144],"values":[145],"{\u22121,0,1},":[147],"show":[149],"they":[151],"are":[152],"unlikely":[153],"more":[158],"2-sparse":[160],"bounded":[163],"\u21131-norm.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}