Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete

TL;DR

This paper proves that maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is an APX-complete problem, indicating it is computationally hard to approximate within certain bounds.

Contribution

The paper establishes the computational complexity of maximizing accepted flows in TDMA wireless networks as APX-complete, a novel theoretical result.

Findings

Maximizing accepted flows is APX-complete.

No efficient approximation scheme exists within certain bounds.

Highlights the inherent computational difficulty of network capacity optimization.

Abstract

Full exploitation of the bandwidth resources of Wireless Networks is challenging because of the sharing of the radio medium among neighboring nodes. Practical algorithms and distributed schemes that tries to optimising the use of the network radio resources. In this technical report we present the proof that maximising the network capacity is is an APX Complete problem (not approximable within 1/(1 - 2^(-k)) - eps for eps > 0).