STACS 2004
From MaRDI portal
Publication:5309717
DOI10.1007/B96012zbMath1122.68452OpenAlexW4236485840MaRDI QIDQ5309717
Sachin Lodha, Murali Ganapathy
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
schedulingmulticastComputational complexityhardness of approximationpolynomial time approximation scheme
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: STACS 2004