What is the most prestigious award received by the author of 'An adaptive algorithm for selecting profitable keywords for search-based advertising services'?
Fulkerson Prize in 2000
Alok Aggarwal et al.: Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. (2000) authored by David P Williamson. Monika Henzinger et al.: A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. (2023) authored by David P Williamson. David P. Williamson is the author of Lisa Fleischer et al.: An Iterative Round of the TSP. Lisa Fleischer et al.: A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems. (2022) authored by David P. Williamson. David R. Karger and David P. Williamson: Recursive Random Contraction Revisited. (2021) authored by David P. Williamson. David P Williamson is the author of The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP. (2001) and is the author of The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP. (1998). David P. Williamson: Easy capacitated facility location problems, with connections to lot-sizing. (2020) authored by David P. Williamson He also received the Frederick W.
[INST]
Utilize the provided context information, to generate answers to the following question: 
- Generate the answer to the question based on the provided context.
- Avoid including any explanations or apologies in your responses.
- Only respond to questions that ask for the answer to the target question without any additional information.
- Strictly provide the answer without any additional text.
Question: What is the most prestigious award received by the author of 'An adaptive algorithm for selecting profitable keywords for search-based advertising services'?
Context: Alok Aggarwal et al.: Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. (2000) authored by David P Williamson. Monika Henzinger et al.: A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. (2023) authored by David P Williamson. David P. Williamson is the author of Lisa Fleischer et al.: An Iterative Round of the TSP. Lisa Fleischer et al.: A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems. (2022) authored by David P. Williamson. David R. Karger and David P. Williamson: Recursive Random Contraction Revisited. (2021) authored by David P. Williamson. David P Williamson is the author of The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP. (2001) and is the author of The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP. (1998). David P. Williamson: Easy capacitated facility location problems, with connections to lot-sizing. (2020) authored by David P. Williamson He also received the Frederick W.
[/INST] Answer:
