{"id":"https://openalex.org/W2020636116","doi":"https://doi.org/10.1007/s00453-003-1058-x","title":"Algorithms for Minimizing Response Time in Broadcast Scheduling","display_name":"Algorithms for Minimizing Response Time in Broadcast Scheduling","publication_year":2003,"publication_date":"2003-12-19","ids":{"openalex":"https://openalex.org/W2020636116","doi":"https://doi.org/10.1007/s00453-003-1058-x","mag":"2020636116"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-003-1058-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1058-x","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5015765462","display_name":"Rajiv Gandhi","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajiv Gandhi","raw_affiliation_strings":["Department of Computer Science, Rutgers University, Camden, NJ 08102, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, Camden, NJ 08102, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland,\nCollege Park, MD 20742, USA","Department of Computer Science and Institute for Advanced Computer Studies,University of Maryland, College Park, MD 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland,\nCollege Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies,University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113946149","display_name":"Yoo-Ah Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yoo-Ah Kim","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD 20742, USA","Department of Computer Science, University of Maryland, College Park, MD 20742 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD 20742 USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111446983","display_name":"Yung-Chun Wan","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yung-Chun (Justin) Wan","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD 20742 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD 20742 USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015765462"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.4882,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.91134985,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"4","first_page":"597","last_page":"608"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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":0.9997000098228455,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9945999979972839,"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.9858999848365784,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7146198749542236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.710550844669342},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.67310631275177},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.60957932472229},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5306388735771179},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4868401885032654},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.48454728722572327},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41470786929130554},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.4100591540336609},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3917047083377838},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3339625298976898},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2794114351272583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2483847737312317},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07181882858276367}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7146198749542236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.710550844669342},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.67310631275177},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.60957932472229},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5306388735771179},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4868401885032654},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.48454728722572327},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41470786929130554},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.4100591540336609},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3917047083377838},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3339625298976898},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2794114351272583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2483847737312317},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07181882858276367},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-003-1058-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1058-x","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W146563418","https://openalex.org/W276536446","https://openalex.org/W1498726528","https://openalex.org/W1573226348","https://openalex.org/W1576873985","https://openalex.org/W1584243868","https://openalex.org/W1769679476","https://openalex.org/W1931508614","https://openalex.org/W1964586194","https://openalex.org/W1984034567","https://openalex.org/W1991596659","https://openalex.org/W1994636110","https://openalex.org/W2007479771","https://openalex.org/W2023770210","https://openalex.org/W2063801913","https://openalex.org/W2067103503","https://openalex.org/W2086365412","https://openalex.org/W2086718700","https://openalex.org/W2122296645","https://openalex.org/W2251008807","https://openalex.org/W2295130467","https://openalex.org/W2295428206","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W2976445918","https://openalex.org/W3105368489","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W1759995226","https://openalex.org/W2962917430","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W1843100083","https://openalex.org/W1510578411","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}