Structural Information and Communication Complexity

DOI10.1007/B98251zbMATH Open1085.68519OpenAlexW2499215041MaRDI QIDQ5315231

Rachel Matichin, David Peleg

Publication date: 7 September 2005

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (3)

Approximation algorithm for hotlink assignment in the greedy model ⋮ An experimental study of recent hotlink assignment algorithms ⋮ An Experimental Study of Recent Hotlink Assignment Algorithms

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

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