Multiple hotlink assignment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2204, Issue , 2001, Pages 189-200

  Fuhrmann, Sven ^a   Oliver Krumke, Sven ^b   Wirth, Hans Christoph ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH ALGORITHMS;

ASSIGNMENT PROBLEMS; DIRECTED ACYCLIC GRAPH (DAG); HOTLINKS; ROOT NODES; SHORTEST PATH;

DIRECTED GRAPHS;

EID: 23044530455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_18     Document Type: Conference Paper

References (6)

1. 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.
2. O. BERMAN Improving the location of minisum facilities through network modification Annals of Operations Research 40 (1992) 1-16.
3. 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.
4. K. P. ESWARAN AND R. E. TARJAN Augmentation problems SIAM Journal on Computing 10 (1976), no. 2, 270-283.
5. D. S. HOCHBAUM (ed.) Approximation algorithms for NP-hard problems PWS Publishing Company, Boston, 1997.
6. S. KHULLER Approximation algorithms for finding highly connected subgraphs in [5], 1997.