"Optimal Freshness Crawl Under Politeness Constraints."

Andrey Kolobov et al. (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics