Efficient web searching using temporal factors

Theoretical Computer Science

Volumn 262, Issue 1-2, 2001, Pages 569-582

  Czumaj, Artur ^a   Finch, Ian ^b   Gasieniec, Leszek ^b   Gibbons, Alan ^b   Leng, Paul ^b   Rytter, Wojciech ^b   Zito, Michele ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Approximation; Matching; Random; Sequencing; Web searching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; RANDOM PROCESSES;

VARIABLE LENGTH SEQUENCING PROBLEM (VLSP);

SEARCH ENGINES;

EID: 0034925218     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00366-2     Document Type: Article

References (12)

1. Theory of computing: Goals and directions
2. Worst-case analysis of a new heuristic for the travelling salesman problem
3. The RBSE spider - Balancing effective search against Web load
4. An explicit lower bound for TSP with distances one and two
5. Two-processor scheduling with start-times and deadlines
6. A guided tour of Chernoff bounds
7. Computational complexity
8. An O(√|v|·|E|) algorithm for finding maximum matching in general graphs
9. Matchings in random regular bipartite digraphs