Efficient web searching using temporal factors

DOI10.1016/S0304-3975(00)00366-2zbMath0983.68045OpenAlexW2023162794WikidataQ113440333 ScholiaQ113440333MaRDI QIDQ5958137

Artur Czumaj, P. Leng, Leszek Gąsieniec, Alan M. Gibbons, I. Finch, Wojciech Rytter, Michele Zito

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00366-2

zbMATH Keywords

randommatchingapproximationsequencingweb searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10)

Related Items (2)

On polynomial-time approximation algorithms for the variable length scheduling problem. ⋮ Approximation algorithms for time-dependent orienteering.

Cites Work

• A guided tour of Chernoff bounds
• Matchings in random regular bipartite digraphs
• Two-Processor Scheduling with Start-Times and Deadlines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient web searching using temporal factors