Hotlink assignment.

zbMATH Open1255.68007MaRDI QIDQ3584083FDOQ3584083

Authors: Tobias Jacobs 

Publication date: 18 August 2010

Full work available at URL: http://www.freidok.uni-freiburg.de/volltexte/6606/pdf/jacobs09.pdf

Recommendations

• On the complexity of optimal hotlink assignment
• On the Complexity of Optimal Hotlink Assignment
• scientific article; zbMATH DE number 2081037
• An Experimental Study of Recent Hotlink Assignment Algorithms
• Constant Factor Approximations for the Hotlink Assignment Problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)

Cited In (9)

• Title not available (Why is that?)
• Automata, Languages and Programming
• On the complexity of optimal hotlink assignment
• Algorithms and Computation
• Structural Information and Communication Complexity
• Constant factor approximations for the hotlink assignment problem
• Improved approximations for the hotlink assignment problem
• On the Complexity of Optimal Hotlink Assignment
• Constant Factor Approximations for the Hotlink Assignment Problem

This page was built for publication: Hotlink assignment.

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