FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897766
DOI10.1007/11590156zbMath1172.68683OpenAlexW2484051058MaRDI QIDQ5897766
No author found.
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Communication networks in operations research (90B18) Approximation algorithms (68W25) Communication theory (94A05)
Related Items (3)
LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ Complexity and online algorithms for minimum skyline coloring of intervals
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science