The Complexity of Optimal Addressing in Radio Networks

DOI10.1109/TCOM.1982.1095431MaRDI QIDQ3953691zbMATH OpenFDO

Authors Sam Toueg, Ken Steiglitz

Publication date 1982

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCOM.1982.1095431

zbMATH Keywords

complexity of finding optimal fixed- or variable-length unambiguous address codesfixed-length codesgraph coloringNP-completepacket radio networksuboptimal heuristic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Communication, information (94A99)

This page was built for publication: The Complexity of Optimal Addressing in Radio Networks

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