Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning

DOI10.1109/TAC.2008.2006820MaRDI QIDQ4974373zbMATH OpenOpenAlexFDO

Authors Saswati Sarkar, Saikat Ray

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

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

Cited in

(4)

• A two-level graph partitioning problem arising in mobile wireless communications
• Energy efficient spatial TDMA scheduling in wireless networks
• A new distributed approximation algorithm for the maximum weight independent set problem
• Perfect periodic scheduling for binary tree routing in wireless networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974373)