The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 29 NO.5 / (2000))
Optimal Information Gathering on the Internet with Time and Cost Constraints
Oren Etzioni, Steve Hanks, Tao Jiang, Omid Madani,
Pages. 1596-1620
Abstract
Contents 1. Introduction 2. The complexity of computing optimal querying policies 3. Approximating optimal single-batch policies 4. Approximating optimal $k$-batch policies 5. Approximation algorithms for the cost threshold models 6. Concluding remarks
Key words approximation algorithm, batched policy, computational complexity, information gathering, information retrieval, Internet, scheduling, time and cost trade off, World Wide Web
Mathmatical Subject Classification 68Q20, 68Q25, 90B35