scientific article; zbMATH DE number 2044936

MaRDI QIDQ4448759zbMATH OpenFDO

Authors Sven Fuhrmann, Sven O. Krumke, H.-C. Wirth

Publication date 18 February 2004

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the complexity of optimal hotlink assignment
• Constant factor approximations for the hotlink assignment problem
• On the Complexity of Optimal Hotlink Assignment
• Hotlink assignment.
• Improved approximations for the hotlink assignment problem

Cited in

(5)

• Approximate hotlink assignment
• On the complexity of optimal hotlink assignment
• Optimal approximability of bookmark assignments
• scientific article; zbMATH DE number 5778022 (Why is no real title available?)
• 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 Q4448759)