Equivalence of two linear programming relaxations for broadcast scheduling.

DOI10.1016/J.ORL.2003.11.012zbMath1054.90033OpenAlexW2086754585MaRDI QIDQ703264

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

zbMATH Keywords

approximation algorithms

Mathematics Subject Classification ID

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

Cites Work

• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• Unnamed Item
• Unnamed Item

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