Wireless Communication Is in APX

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.

• Type: Conference
• Year: 2009
• Where: ICALP
• Authors: Magnús M. Halldórsson, Roger Wattenhofer
• Keywords: ICALP 2009, Theoretical Computer Science, Wireless Communication Requests, Wireless Scheduling Problem