scientific article; zbMATH DE number 2081037

MaRDI QIDQ4474141zbMATH OpenFDO

Authors Evangelos Kranakis, D. Krizanc, Sunil Shende

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230756.htm

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.
• scientific article; zbMATH DE number 2080232 (Why is no real title available?)
• Maximum rooted connected expansion
• Algorithms and Computation
• Algorithms and Data Structures
• Near-Entropy Hotlink Assignments
• Automata, Languages and Programming
• Algorithms and Computation
• Near-entropy hotlink assignments

This page was built for publication:

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