Abstract
The input for the hotlink assignment problem consists of a node weighted directed acyclic graph with a designated root node r. The goal is to minimize the weighted shortest path length rooted at r by adding a restricted number of outgoing arcs (hotlinks) to each node. The (h, k)-hotlink assignment problem is defined on k-regular complete trees, and at most h hotlinks can be assigned to each node.We contribute algorithms for the (1, k), (2, k), and (k-1, k) hotlink assignment problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Bose, J. Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, and M. V. Martin · Strategies for hotlink assignment · Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC’00), Lecture Notes in Computer Science, vol. 1969, Springer, 2001, pp. 23–34.
O. Berman · Improving the location of minisum facilities through network modification · Annals of Operations Research 40 (1992), 1–16.
Y. Dodis and S. Khanna · Designing networks with bounded pairwise distance · Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (STOC’99), 1999, pp. 750–759.
K. P. Eswaran and R. E. Tarjan · Augmentation problems · SIAM Journal on Computing 10 (1976), no. 2, 270–283.
D. S. Hochbaum (ed.) · Approximation algorithms for NP-hard problems · PWS Publishing Company, Boston, 1997.
S. Khuller · Approximation algorithms for finding highly connected subgraphs · in [5], 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fuhrmann, S., Krumke, S.O., Wirth, HC. (2001). Multiple Hotlink Assignment. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_18
Download citation
DOI: https://doi.org/10.1007/3-540-45477-2_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42707-0
Online ISBN: 978-3-540-45477-9
eBook Packages: Springer Book Archive