Approximate hotlink assignment

DOI10.1007/3-540-45678-3_64MaRDI QIDQ4474141zbMATH OpenFDO

Authors Evangelos Kranakis, D. Krizanc, Sunil Shende

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230756.htm, https://ir.library.carleton.ca/pub/4624

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

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

Cited in

(13)

• Approximation algorithm for hotlink assignment in the greedy model
• Approximate hotlink assignment
• Dynamic hotlinks
• Optimal key systems
• Hotlink assignment.
• Strategies for hotlink assignments
• Maximum rooted connected expansion
• Algorithms and Computation
• Algorithms and Data Structures
• Near-Entropy Hotlink Assignments
• Optimal website design with the constrained subtree selection problem
• Efficient algorithms for the hotlink assignment problem: The worst case search
• Near-entropy hotlink assignments

This page was built for publication: Approximate hotlink assignment

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