Structural Information and Communication Complexity

DOI10.1007/b136628zbMath1085.68503OpenAlexW2480963397MaRDI QIDQ5710095

David Coudert, Jean-Claude Bermond, Laurent Braud

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136628

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication theory (94A05)

Related Items (3)

Traffic grooming on the path ⋮ Approximating the traffic grooming problem in tree and star networks ⋮ Approximating the traffic grooming problem

This page was built for publication: Structural Information and Communication Complexity