Hotlink assignment.

MaRDI QIDQ3584083zbMATH OpenFDO

Authors Tobias Jacobs

Publication date 18 August 2010

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

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of optimal hotlink assignment
• On the Complexity of Optimal Hotlink Assignment
• Approximate hotlink assignment
• An Experimental Study of Recent Hotlink Assignment Algorithms
• Constant Factor Approximations for the Hotlink Assignment Problem

Cited in

(9)

• On the complexity of optimal hotlink assignment
• 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
• Multiple hotlink assignment
• Algorithms and Computation
• Approximation algorithm for hotlink assignment in the greedy model
• Optimal website design with the constrained subtree selection 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)