|
Volumn 3341, Issue , 2004, Pages 778-792
|
Efficient algorithms for the hotlink assignment problem: The worst case search
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION ALGORITHMS;
COMBINATORIAL OPTIMIZATION;
DYNAMIC PROGRAMMING;
HYPERTEXT SYSTEMS;
POLYNOMIAL APPROXIMATION;
TREES (MATHEMATICS);
DECISION TREES;
FORESTRY;
WEBSITES;
APPROXIMATE ALGORITHMS;
ASSIGNMENT PROBLEMS;
DIRECTED PATHS;
DIRECTED TREES;
HOTLINKS;
HOTLINKS ASSIGNMENTS;
HYPERLINKS;
ROOT NODES;
WEB-PAGE;
WEB-SITES;
APPROXIMATION RATIOS;
BOUNDED DEGREE;
DYNAMIC PROGRAMMING ALGORITHM;
POLY-TIME ALGORITHMS;
POLYNOMIAL-TIME ALGORITHMS;
WEBSITES;
APPROXIMATION ALGORITHMS;
|
EID: 26844556519
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-30551-4_67 Document Type: Article |
Times cited : (15)
|
References (9)
|