scientific article; zbMATH DE number 2080232

zbMATH Open1044.68693MaRDI QIDQ4472476FDOQ4472476

Authors: Prosenjit Bose, Jurek Czyzowicz, Andrzej Pelc, Miguel Vargas Martin, Leszek Gąsieniec, Evangelos Kranakis, D. Krizanc 

Publication date: 4 August 2004

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

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2081037
• Approximate hotlink assignment
• On the complexity of optimal hotlink assignment
• On the Complexity of Optimal Hotlink Assignment
• Near-Entropy Hotlink Assignments

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (9)

• Optimal approximability of bookmark assignments
• Near-entropy hotlink assignments
• Max-stretch reduction for tree spanners
• On Approximation of Bookmark Assignments
• Approximation algorithm for hotlink assignment in the greedy model
• On the complexity of optimal hotlink assignment
• Approximate hotlink assignment
• Optimal key systems
• Dynamic hotlinks

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 Q4472476)