Equivalence of two linear programming relaxations for broadcast scheduling.

DOI10.1016/J.ORL.2003.11.012zbMATH Open1054.90033OpenAlexW2086754585MaRDI QIDQ703264FDOQ703264

Authors: Samir Khuller, Yoo-Ah Kim 

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.012

Recommendations

• Improved Approximation Algorithms for Broadcast Scheduling
• Algorithms for minimizing response time in broadcast scheduling
• scientific article; zbMATH DE number 2086938
• Theoretical Computer Science
• Publication:4952666

zbMATH Keywords

approximation algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Minimizing setup in broadcast-optimal two round MPC

This page was built for publication: Equivalence of two linear programming relaxations for broadcast scheduling.

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