Paper Info
Title
Multiple Hotlink Assignment
Abstract
Abstract: The input for the hotlink assignment problem consists of anode weighted directed acyclic graph with a designated root node r. Thegoal is to minimize the weighted shortest path length rooted at r byadding a restricted number of outgoing arcs (hotlinks) to each node.
Year
DOI
Venue
2001
10.1007/3-540-45477-2_18
Workshop on Graph-Theoretic Concepts in Computer Science
Keywords
Field
DocType
acyclic graph,restricted number,h hotlinks,k-regular complete tree,multiple hotlink assignment,root node,weighted shortest path length,hotlink assignment problem,outgoing arc,assignment problem,directed acyclic graph,shortest path
Complete graph,Discrete mathematics,Combinatorics,Shortest path problem,Path length,Computer science,Directed graph,Directed acyclic graph,Assignment problem,Regular graph
Conference
ISBN
Citations 
PageRank 
3-540-42707-4
13
1.33
References 
Authors
4
3
Name
Order
Citations
PageRank
Sven Fuhrmann119222.38
Sven Oliver Krumke227027.21
Hans-christoph Wirth314615.90