{"id":"https://openalex.org/W2108248067","doi":"https://doi.org/10.1145/2636916","title":"Better Scalable Algorithms for Broadcast Scheduling","display_name":"Better Scalable Algorithms for Broadcast Scheduling","publication_year":2014,"publication_date":"2014-08-25","ids":{"openalex":"https://openalex.org/W2108248067","doi":"https://doi.org/10.1145/2636916","mag":"2108248067"},"language":"en","primary_location":{"id":"doi:10.1145/2636916","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636916","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravishankar Krishnaswamy","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["IBM T.J. Watson Research Center","IBM T.J. Watson research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center","institution_ids":[]},{"raw_affiliation_string":"IBM T.J. Watson research Center","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0448,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81249453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9889000058174133,"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/T11478","display_name":"Caching and Content Delivery","score":0.9811999797821045,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7733093500137329},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7039395570755005},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6474837064743042},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6448229551315308},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5432302951812744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4591256380081177},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32962390780448914},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17620572447776794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1687467098236084},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.14519605040550232},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09587714076042175}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7733093500137329},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7039395570755005},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6474837064743042},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6448229551315308},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5432302951812744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4591256380081177},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32962390780448914},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17620572447776794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1687467098236084},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.14519605040550232},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09587714076042175},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2636916","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636916","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/a9c6d4d8-630b-4b19-b143-6b671b405649","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/a9c6d4d8-630b-4b19-b143-6b671b405649","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Krishnaswamy, R & Nagarajan, V 2014, 'Better scalable algorithms for broadcast scheduling', ACM Transactions on Algorithms, vol. 11, no. 1, pp. 3/1-24. https://doi.org/10.1145/2636916","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a9c6d4d8-630b-4b19-b143-6b671b405649","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/a9c6d4d8-630b-4b19-b143-6b671b405649","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":"ACM Transactions on Algorithms, 11(1), 3/1 - 24. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1664046972","display_name":null,"funder_award_id":"639.022.211","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":28,"referenced_works":["https://openalex.org/W98190632","https://openalex.org/W1501066815","https://openalex.org/W1528341984","https://openalex.org/W1618165415","https://openalex.org/W1868304495","https://openalex.org/W1911636809","https://openalex.org/W1963631805","https://openalex.org/W1966544820","https://openalex.org/W1972868674","https://openalex.org/W1981710280","https://openalex.org/W2007604989","https://openalex.org/W2018043895","https://openalex.org/W2019306084","https://openalex.org/W2020636116","https://openalex.org/W2024161125","https://openalex.org/W2033816753","https://openalex.org/W2053806044","https://openalex.org/W2067103503","https://openalex.org/W2067139730","https://openalex.org/W2068871408","https://openalex.org/W2105862720","https://openalex.org/W2106728658","https://openalex.org/W2109827459","https://openalex.org/W2127274846","https://openalex.org/W2151527192","https://openalex.org/W2619929065","https://openalex.org/W3138033350","https://openalex.org/W4255005259"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"In":[0],"the":[1,45,68,106,119,132],"classical":[2],"broadcast":[3,63,124],"scheduling":[4,125],"problem":[5],",":[6],"there":[7],"are":[8,91],"n":[9],"pages":[10,19,129],"stored":[11],"at":[12],"a":[13,24,54,80],"server,":[14],"and":[15,74,89,96,113,130,138],"requests":[16,32,115],"for":[17,33,62,123],"these":[18],"arrive":[20],"over":[21,67],"time.":[22],"Whenever":[23],"page":[25,111],"is":[26,38,118],"broadcast,":[27],"it":[28],"satisfies":[29],"all":[30],"outstanding":[31],"that":[34],"page.":[35],"The":[36],"objective":[37],"to":[39,105],"minimize":[40],"average":[41],"flow":[42],"time":[43],"of":[44,72,109],"requests.":[46],"For":[47],"any":[48],"\u03f5":[49],">":[50],"0,":[51],"we":[52],"give":[53],"(1+\u03f5)-speed":[55,81],"O":[56,82],"(1/\u03f5":[57,83],"3":[58],")-competitive":[59,85],"online":[60],"algorithm":[61,88,122],"scheduling.":[64],"This":[65,117],"improves":[66],"recent":[69],"breakthrough":[70],"result":[71],"Im":[73,95,137],"Moseley":[75,97,139],"[2010],":[76],"where":[77],"they":[78],"obtained":[79],"11":[84],"algorithm.":[86],"Our":[87],"analysis":[90],"considerably":[92],"simpler":[93],"than":[94],"[2010].":[98,140],"More":[99],"importantly,":[100],"our":[101],"techniques":[102],"also":[103],"extend":[104],"general":[107],"setting":[108],"nonuniform":[110],"sizes":[112],"dependent":[114],".":[116],"first":[120],"scalable":[121],"with":[126],"varying":[127],"size":[128],"resolves":[131],"main":[133],"open":[134],"question":[135],"from":[136]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}