{"id":"https://openalex.org/W2151527192","doi":"https://doi.org/10.1137/060674417","title":"Improved Approximation Algorithms for Broadcast Scheduling","display_name":"Improved Approximation Algorithms for Broadcast Scheduling","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2151527192","doi":"https://doi.org/10.1137/060674417","mag":"2151527192"},"language":"en","primary_location":{"id":"doi:10.1137/060674417","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060674417","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/f3d77fe3-31cc-4b43-aac1-d940c9b06e21","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/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":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598","IDA Center for Communications Research, Princeton, NJ 08540"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IDA Center for Communications Research, Princeton, NJ 08540","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067588072","display_name":"Don Coppersmith","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Don Coppersmith","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111449864","display_name":"Maxim Sviridenko","orcid":null},"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":"Maxim Sviridenko","raw_affiliation_strings":["IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":null,"apc_paid":null,"fwci":1.356,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.8294195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"38","issue":"3","first_page":"1157","last_page":"1174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9733999967575073,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9733999967575073,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.948199987411499,"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/T12042","display_name":"Satellite Communication Systems","score":0.9103000164031982,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/computer-science","display_name":"Computer science","score":0.635348379611969},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5354599952697754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5095439553260803},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.498521089553833},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26035767793655396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24396157264709473}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.635348379611969},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5354599952697754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5095439553260803},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.498521089553833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26035767793655396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24396157264709473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/060674417","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060674417","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"},{"id":"pmh:oai:pure.tue.nl:openaire/f3d77fe3-31cc-4b43-aac1-d940c9b06e21","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/f3d77fe3-31cc-4b43-aac1-d940c9b06e21","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Coppersmith, D & Sviridenko, M 2008, 'Improved approximation algorithms for broadcast scheduling', SIAM Journal on Computing, vol. 38, no. 3, pp. 1157-1174. https://doi.org/10.1137/060674417","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/f3d77fe3-31cc-4b43-aac1-d940c9b06e21","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/f3d77fe3-31cc-4b43-aac1-d940c9b06e21","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 38(3), 1157 - 1174. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/f3d77fe3-31cc-4b43-aac1-d940c9b06e21","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/f3d77fe3-31cc-4b43-aac1-d940c9b06e21","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Coppersmith, D & Sviridenko, M 2008, 'Improved approximation algorithms for broadcast scheduling', SIAM Journal on Computing, vol. 38, no. 3, pp. 1157-1174. https://doi.org/10.1137/060674417","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1599814229","https://openalex.org/W1769679476","https://openalex.org/W1994636110","https://openalex.org/W2006093991","https://openalex.org/W2007604989","https://openalex.org/W2019306084","https://openalex.org/W2020291377","https://openalex.org/W2067103503","https://openalex.org/W2072291569","https://openalex.org/W2086754585"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829"],"abstract_inverted_index":{"We":[0,68],"consider":[1,69],"scheduling":[2],"policies":[3],"in":[4],"a":[5,27,211],"client-server":[6],"system":[7],"where":[8,80],"the":[9,17,23,49,59,70,74,81,85,88,91,96,102,126,147,155,164,177,217],"server":[10,29,50],"delivers":[11],"data":[12],"by":[13],"broadcasting":[14],"it":[15,98],"to":[16],"users.":[18],"In":[19],"thesimplest":[20],"model":[21],"of":[22,34,58,72,78,84,105,116,133,161,176,216],"problem,":[24],"there":[25],"is":[26,87,93,99,144,150,198],"single":[28],"that":[30,66],"holds":[31],"n":[32,139],"pages":[33,41],"unit":[35],"size.":[36],"Multiple":[37],"requests":[38,61],"for":[39,62,123,163],"these":[40],"arrive":[42],"over":[43],"time.":[44,67],"At":[45],"each":[46],"time":[47,77,83,97,132],"slot":[48],"broadcasts":[51],"exactly":[52],"one":[53],"page":[54,64],"which":[55,143],"satisfies":[56],"all":[57],"outstanding":[60],"this":[63,106],"at":[65],"problem":[71,107,165],"minimizing":[73],"average":[75,130],"response":[76,82,131],"requests,":[79],"request":[86,92],"duration":[89],"since":[90],"placed":[94],"until":[95],"satisfied.":[100],"For":[101],"offline":[103],"version":[104],"we":[108],"give":[109],"an":[110,113,129,205],"algorithm":[111,127],"with":[112],"approximation":[114,159],"ratio":[115],"$O(\\log^2(n)":[117],"/":[118],"\\log":[119],"\\log(n))$.":[120],"More":[121],"generally,":[122],"any":[124],"$\\epsilon>0$,":[125],"achieves":[128],"$(2+\\epsilon)":[134],"\\cdot":[135,140],"\\text{OPT}":[136],"+":[137],"O(\\log":[138],"\\log_{(1+\\epsilon)}":[141],"n)$,":[142],"useful":[145],"when":[146],"optimum":[148],"value":[149],"large.":[151],"This":[152],"substantially":[153],"improves":[154],"previously":[156],"best":[157],"known":[158],"factor":[160],"$O(\\sqrt{n})$":[162],"[N.":[166],"Bansal,":[167],"M.":[168],"Charikar,":[169],"S.":[170],"Khanna,":[171],"and":[172,203],"J.":[173],"Naor,":[174],"Proceedings":[175],"Sixteenth":[178],"Annual":[179],"ACM-SIAM":[180],"Symposium":[181],"on":[182,200],"Discrete":[183],"Algorithms,":[184],"Vancouver,":[185],"British":[186],"Columbia,":[187],"ACM,":[188],"New":[189],"York,":[190],"SIAM,":[191],"Philadelphia,":[192],"2005,":[193],"pp.":[194],"215\u2013221].":[195],"Our":[196],"result":[197],"based":[199],"iteratively":[201],"relaxing":[202],"rounding":[204],"auxiliary":[206],"linear":[207,213],"program":[208],"derived":[209],"from":[210],"natural":[212],"programming":[214],"relaxation":[215],"problem.":[218]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}