On the public citation graph

Broadcast scheduling: Algorithms and complexity

0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/3-540-45253-2_27openalex-snapshot
Scheduling Broadcasts in Wireless Networks
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_24openalex-snapshot
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
inferredcites →https://doi.org/10.1007/s10951-006-5595-4openalex-snapshot
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
inferredcites →https://doi.org/10.1016/j.orl.2003.11.012openalex-snapshot
Equivalence of two linear programming relaxations for broadcast scheduling
inferredcites →https://doi.org/10.1016/j.tcs.2004.02.047openalex-snapshot
Scheduling broadcasts with deadlines
inferredcites →https://doi.org/10.1109/5.16350openalex-snapshot
Broadcast delivery
inferredcites →https://doi.org/10.1109/90.811450openalex-snapshot
R×W: a scheduling approach for large-scale on-demand data broadcast
inferredcites →https://doi.org/10.1109/sfcs.2002.1181955openalex-snapshot
Dependent rounding in bipartite graphs
inferredcites →https://doi.org/10.1145/1147954.1147956openalex-snapshot
Dependent rounding and its applications to approximation algorithms
inferredcites →https://doi.org/10.1145/1497290.1497294openalex-snapshot
Throughput maximization of real-time scheduling with batching
inferredcites →https://doi.org/10.5555/1109557.1109596openalex-snapshot
Improved approximation algorithms for broadcast scheduling
inferredcites →https://doi.org/10.5555/1496770.1496891openalex-snapshot
Online scheduling to minimize the maximum delay factor
inferredcites →https://doi.org/10.5555/314613.314623openalex-snapshot
Minimizing service and operation costs of periodic scheduling
inferredcites →https://doi.org/10.5555/338219.338605openalex-snapshot
Minimizing maximum response time in scheduling broadcasts
inferredcites →https://doi.org/10.5555/545381.545405openalex-snapshot
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcm.2395openalex-snapshot
An on‐demand data broadcasting scheduling algorithm based on dynamic index strategy
inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_28openalex-snapshot
Cost-Sharing Games in Real-Time Scheduling Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-12915-4_8openalex-snapshot
Interval Scheduling Games
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_20openalex-snapshot
Approximating the Interval Constrained Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_19openalex-snapshot
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_40openalex-snapshot
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_6openalex-snapshot
Longest Wait First for Broadcast Scheduling [Extended Abstract]
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_28openalex-snapshot
Better Scalable Algorithms for Broadcast Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_7openalex-snapshot
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-23948-9_7openalex-snapshot
Carousel Scheduling of Advertisement Contents on Digital Multimedia Broadcasting
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_26openalex-snapshot
A Model for Minimizing Active Processor Time
inferred← citeshttps://doi.org/10.1007/s00453-010-9406-0openalex-snapshot
Approximation Algorithms for the Interval Constrained Coloring Problem
inferred← citeshttps://doi.org/10.1007/s00453-013-9807-yopenalex-snapshot
A Model for Minimizing Active Processor Time
inferred← citeshttps://doi.org/10.1007/s00453-023-01177-1openalex-snapshot
Minimizing the Maximum Flow Time in the Online Food Delivery Problem
inferred← citeshttps://doi.org/10.1007/s00530-025-02014-xopenalex-snapshot
Scheduling periodic queries in multi-channel on-demand broadcasting environments
inferred← citeshttps://doi.org/10.1007/s10951-014-0371-3openalex-snapshot
Scheduling to minimize energy and flow time in broadcast scheduling
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.04.006openalex-snapshot
Utility driven optimization of real time data broadcast schedules
inferred← citeshttps://doi.org/10.1016/j.datak.2011.09.005openalex-snapshot
Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.10.033openalex-snapshot
Batch machine production with perishability time windows and limited batch size
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.11.006openalex-snapshot
Freight railcar-to-train assignment and departure scheduling in a railyard
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.026openalex-snapshot
Broadcasting on-demand data with time constraints using multiple channels in wireless broadcast environments
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.10.002openalex-snapshot
A note on on-line broadcast scheduling with deadlines
inferred← citeshttps://doi.org/10.1016/j.jda.2010.07.003openalex-snapshot
Deconstructing intractability—A multivariate complexity analysis of interval constrained coloring
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.06.003openalex-snapshot
A segmentation approach for file broadcast scheduling
inferred← citeshttps://doi.org/10.1016/j.orl.2016.09.016openalex-snapshot
Minimizing the maximum flow time in batch scheduling
inferred← citeshttps://doi.org/10.1016/j.phycom.2012.05.005openalex-snapshot
Real-time delay with network coding and feedback
inferred← citeshttps://doi.org/10.1109/icctdc64446.2025.11158197openalex-snapshot
Examining the Online Food Delivery Problem on K-Ary Trees
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062126openalex-snapshot
UNAP: User-Centric Network-Aware Push for Mobile Content Delivery
inferred← citeshttps://doi.org/10.1109/isit.2009.5205612openalex-snapshot
Delay with network coding and feedback
inferred← citeshttps://doi.org/10.1109/istel.2012.6483062openalex-snapshot
Offline and online broadcast scheduling algorithms for file broadcast in mobile WiMAX
inferred← citeshttps://doi.org/10.1109/tmc.2015.2398417openalex-snapshot
A Novel Scheduling Algorithm for Supporting Periodic Queries in Broadcast Environments
inferred← citeshttps://doi.org/10.1137/1.9781611972917.10openalex-snapshot
Dependent Randomized Rounding: The Bipartite Case
inferred← citeshttps://doi.org/10.1137/1.9781611973730.71openalex-snapshot
New Approximations for Broadcast Scheduling via Variants of α-point Rounding
inferred← citeshttps://doi.org/10.1145/2344422.2344429openalex-snapshot
An online scalable algorithm for average flow time in broadcast scheduling
inferred← citeshttps://doi.org/10.1145/2486159.2486161openalex-snapshot
Online batch scheduling for flow objectives
inferred← citeshttps://doi.org/10.1145/2636916openalex-snapshot
Better Scalable Algorithms for Broadcast Scheduling
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a007openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.0807.1891openalex-snapshot
Online Scheduling to Minimize the Maximum Delay Factor
inferred← citeshttps://doi.org/10.48550/arxiv.0906.2395openalex-snapshot
Longest Wait First for Broadcast Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1007.3747openalex-snapshot
Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1208.0312openalex-snapshot
A Model for Minimizing Active Processor Time
inferred← citeshttps://doi.org/10.5555/1496770.1496891openalex-snapshot
Online scheduling to minimize the maximum delay factor
inferred← citeshttps://doi.org/10.5555/2133036.2133045openalex-snapshot
Online scalable scheduling for the lk-norms of flow time without conservation of work
inferred← citeshttps://doi.org/10.5555/2634074.2634079openalex-snapshot
Better algorithms and hardness for broadcast scheduling via a discrepancy approach
inferred← citeshttps://doi.org/10.6109/jkiice.2015.19.12.2981openalex-snapshot
Resource Augmentation Analysis on Broadcast Scheduling for Requests with Deadlines
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.