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

Simple item page
dc.creatorBruno, Raffaele
dc.creatorConan, Vania
dc.creatorRousseau, Stephane
dc.date2009-04-08
dc.date.accessioned2026-07-07T13:01:38Z
dc.date.available2026-07-07T13:01:38Z
dc.descriptionFull 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).
dc.identifierhttps://arxiv.org/abs/0904.1243
dc.identifierhttp://arxiv.org/abs/0904.1243
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226215
dc.subjectNetworking and Internet Architecture
dc.titleMaximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete
dc.typetext

Files

Collections

arXiv