Wireless Communication Is in APX

  • Authors:
  • Magnús M. Halldórsson;Roger Wattenhofer

  • Affiliations:
  • School of Computer Science, Reykjavik University, Reykjavik, Iceland 103;Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland

  • Venue:
  • ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we address a common question in wireless communication: How long does it take to satisfy an arbitrary set of wireless communication requests? This problem is known as the wireless scheduling problem. Our main result proves that wireless scheduling is in APX. In addition we present a robustness result, showing that constant parameter and model changes will modify the result only by a constant.