Near-Entropy Hotlink Assignments

DOI10.1007/11841036_28MaRDI QIDQ5449536zbMATH OpenOpenAlexFDO

Authors Karim Douïeb, Stefan Langerman

Publication date 11 March 2008

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

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9352

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Near-entropy hotlink assignments
• Approximate hotlink assignment
• Approximate hotlink assignment
• Dynamic hotlinks
• Algorithms and Data Structures

Cited in

(10)

• Approximate hotlink assignment
• On the complexity of optimal hotlink assignment
• Dynamic hotlinks
• Strategies for hotlink assignments
• Approximate hotlink assignment
• An Experimental Study of Recent Hotlink Assignment Algorithms
• Algorithms and Data Structures
• An experimental study of recent hotlink assignment algorithms
• Near-entropy hotlink assignments
• An approximation algorithm for binary searching in trees

This page was built for publication: Near-Entropy Hotlink Assignments

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