Approximation and Online Algorithms

DOI10.1007/B106130zbMATH Open1124.90322OpenAlexW4299357393MaRDI QIDQ5713439FDOQ5713439

Marc Nunkesser, Riko Jacob, Gábor Szabó, Thomas Erlebach, Peter Widmayer, Matúš Mihalák

Publication date: 14 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106130

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Communication networks in operations research (90B18)

   Recommendations

• Approximation for a scheduling problem with application in wireless networks 👍 👎
• Wireless scheduling with power control 👍 👎
• Wireless Scheduling with Power Control 👍 👎
• Title not available (Why is that?) 👍 👎
• Oblivious interference scheduling 👍 👎

This page was built for publication: Approximation and Online Algorithms

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