scientific article; zbMATH DE number 2086938

MaRDI QIDQ4737543zbMATH OpenFDO

Authors Rajiv Gandhi, Samir Khuller, Yoo-Ah Kim, Yung-Chun Justin Wan

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370425.htm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Communication networks in operations research (90B18)

Recommendations

• Algorithms for minimizing response time in broadcast scheduling
• Improved Approximation Algorithms for Broadcast Scheduling
• Publication:4952666
• Broadcast scheduling, algorithms and complexity
• Approximating the average response time in broadcast scheduling

Cited in

(14)

• scientific article; zbMATH DE number 1670667 (Why is no real title available?)
• Equivalence of two linear programming relaxations for broadcast scheduling.
• Algorithms for minimizing response time in broadcast scheduling
• Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
• scientific article; zbMATH DE number 1445348 (Why is no real title available?)
• Approximating the average response time in broadcast scheduling
• Better Scalable Algorithms for Broadcast Scheduling
• Improved Approximation Algorithms for Broadcast Scheduling
• Computing and Combinatorics
• A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
• Scheduling broadcasts with deadlines
• Scheduling broadcasts in wireless networks
• Broadcast scheduling, algorithms and complexity
• New approximations for broadcast scheduling via variants of \(\alpha\)-point rounding

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737543)