{"id":"https://openalex.org/W3040528764","doi":"https://doi.org/10.1137/18m1202451","title":"Fair Scheduling via Iterative Quasi-Uniform Sampling","display_name":"Fair Scheduling via Iterative Quasi-Uniform Sampling","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3040528764","doi":"https://doi.org/10.1137/18m1202451","mag":"3040528764"},"language":"en","primary_location":{"id":"doi:10.1137/18m1202451","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1202451","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5423,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7346093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"49","issue":"3","first_page":"658","last_page":"680"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/rounding","display_name":"Rounding","score":0.8114577531814575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.601871907711029},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5677765607833862},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5020074844360352},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.463552862405777},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4607795774936676},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43582719564437866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38757216930389404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36223942041397095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3375762104988098},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08006554841995239}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8114577531814575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.601871907711029},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5677765607833862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5020074844360352},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.463552862405777},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4607795774936676},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43582719564437866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38757216930389404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36223942041397095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3375762104988098},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08006554841995239},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1202451","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1202451","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6899999976158142}],"awards":[{"id":"https://openalex.org/G1521119565","display_name":null,"funder_award_id":"CCF-1824303","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4353574214","display_name":null,"funder_award_id":"CCF-1617653","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G691689332","display_name":null,"funder_award_id":"CCF-1409130","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6993358345","display_name":null,"funder_award_id":"CCF-1844939","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7267236355","display_name":null,"funder_award_id":"CCF-1830711","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8411882594","display_name":null,"funder_award_id":"CCF-1845146","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1963663039","https://openalex.org/W1972337144","https://openalex.org/W1998136934","https://openalex.org/W2072626473","https://openalex.org/W2081798943","https://openalex.org/W2088632781","https://openalex.org/W2124402683","https://openalex.org/W2134553994","https://openalex.org/W2166867051","https://openalex.org/W2170045213","https://openalex.org/W2570727021"],"related_works":["https://openalex.org/W2507810539","https://openalex.org/W3100114454","https://openalex.org/W2767218854","https://openalex.org/W2085325317","https://openalex.org/W3042545917","https://openalex.org/W2081840458","https://openalex.org/W2013170874","https://openalex.org/W4281741337","https://openalex.org/W2036310503","https://openalex.org/W37721340"],"abstract_inverted_index":{"This":[0,38],"paper":[1],"considers":[2],"minimizing":[3],"the":[4,41,45,49,68,71,76],"$\\ell_k$-norms":[5],"of":[6,70,90,98],"flow":[7],"time":[8],"on":[9],"a":[10,15,87],"single":[11],"machine":[12],"offline":[13],"using":[14],"preemptive":[16],"scheduler":[17],"for":[18,25,44],"$k\\geq":[19],"1$.":[20],"The":[21,78],"objective":[22],"is":[23,67,86,97],"ideal":[24],"optimizing":[26],"jobs'":[27],"overall":[28],"waiting":[29],"times":[30],"while":[31],"simultaneously":[32],"being":[33],"fair":[34],"to":[35,75],"individual":[36],"jobs.":[37],"work":[39,85],"gives":[40],"first":[42],"$O(1)$-approximation":[43],"problem,":[46],"improving":[47],"upon":[48],"previous":[50],"best":[51],"$O(":[52],"\\log":[53,54],"P)$-approximation":[55],"by":[56],"Bansal":[57],"and":[58,62,93],"Pruhs":[59],"(FOCS":[60],"09":[61],"SICOMP":[63],"14)":[64],"where":[65],"$P$":[66],"ratio":[69],"maximum":[72],"job":[73],"size":[74],"minimum.":[77],"main":[79],"technical":[80],"ingredient":[81],"used":[82],"in":[83,100],"this":[84],"novel":[88],"combination":[89],"quasi-uniform":[91],"sampling":[92],"iterative":[94],"rounding,":[95],"which":[96],"interest":[99],"its":[101],"own":[102],"right.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}