Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning

DOI10.1109/TAC.2008.2006820zbMath1367.90033OpenAlexW2136268609MaRDI QIDQ4974373

Saikat Ray, Saswati Sarkar

Publication date: 8 August 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2008.2006820

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Perfect periodic scheduling for binary tree routing in wireless networks ⋮ Energy efficient spatial TDMA scheduling in wireless networks ⋮ A new distributed approximation algorithm for the maximum weight independent set problem

This page was built for publication: Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning