Optimal information gathering on the Internet with time and cost constraints

SIAM Journal on Computing

Volumn 29, Issue 5, 2000, Pages 1596-1620

  Etzioni, Oren ^a   Hanks, Steve ^a   Jiang, Tao ^b   Madani, Omid ^a  

^a University of Washington   (United States)

^b University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ONLINE SEARCHING; PROBABILITY;

INFORMATION GATHERING;

WORLD WIDE WEB;

EID: 0034541297     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797314465     Document Type: Article

References (18)

1. O. ETZIONI, S. HANKS, T. JIANG, R. M. KARP, O. MADANI, AND O. WAARTS, Efficient information gathering on the Internet, in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 234-243.
2. O. ETZIONI, R. M. KARP, AND O. WAARTS, Efficient Access to Information Sources on the Internet, manuscript, 1996.
3. P. FEIGIN AND G. HAREL, Minimizing costs of personnel testing programs, Naval Research Logistics Quarterly, 29 (1982), pp. 87-95.
4. M. GAREY, Optimal task scheduling with precedence constraints, Discrete Math., 4 (1973), pp. 37-56.
5. M. HENIG AND D. SIMCHI-LEVY, Scheduling tasks with failure probabilities to minimize expected cost, Naval Research Logistics, 37 (1990), pp. 99-109.
6. O. IBARRA AND C. KIM, Fast approximation algorithms for the knapsack and sum of subsets problems, J. ACM, 22 (1975), pp. 463-468.
7. The LEXIS-NEXIS Corporation, 1997; available online at http://www.lexis-nexis.com/Incc/.
8. J. KADANE, Quiz show problems, Math. Anal. Appl., 27 (1969), pp. 609-623.
9. B. KRULWICH, The BargainFinder agent: Comparison price shopping on the Internet, in Bots and Other Internet Beasties, SAMS.NET, Indianapolis, IN, 1996.
10. O. MADANI, Serializing an Irreducible Schedule at most Triples the Value, manuscript, 1996.
11. The Knowledge Finder Corporation, providing access to MEDLINE, 1997; available online at http://www.kfinder.com.
12. L. MITTEN, An analytic solution to the least cost testing sequence problem, J. Indust. Eng., 11 (1960), p. 17.
13. M. PORAT, The Information Economy, U.S. Office of Telecommunications, Dept. of Commerce, Washington, D.C., 1977.
14. S. SAHNI, Approximation algorithms for the 0/1-knapsack problem, J. ACM, 22 (1975), pp. 115-124.
15. Secure Transaction Technology, available online at http://www.visa.com/cgi-bin/vee/sf/ set/intro.html.
16. E. SELBERG AND O. ETZIONI, Multi-service search and comparison using the MetaCrawler, in Proceedings of the 4th World Wide Web Conference, Boston, MA, Elsevier, New York, 1995, pp. 195-208.
17. H. SIMON AND J. KADANE, Optimal problem-solving search: All-or-none solutions, Artificial Intelligence, 6 (1975), pp. 235-247.
18. M. SIRBU AND J. D. TYGAR, NetBill: An internet commerce system optimized for network delivered services, IEEE Personal Communications, 2 (1995), pp. 34-39.