Maximizing profit using recommender systems (2009)
Das, Aparna, Mathieu, Claire, Ricketts, Daniel
Traditional recommendation systems make recommendations based solely on the customer's past purchases, product ratings and demographic data without considering the profitability the items being...
Theory and practise of monotone minimal perfect hashing (2009)
VIGNA, SEBASTIANO, BOLDI, PAOLO, Mathieu, Claire
Theory and practise of monotone minimal perfect hashing / Djamal Belazzougui, Rasmus Pagh, Paolo Boldi, Sebastiano Vigna. - In: ACM-SIAM Symposium on discrete algorithms : January 4-6, 2009, New York...
Theory and practise of monotone minimal perfect hashing (2009)
VIGNA, SEBASTIANO, BOLDI, PAOLO, Mathieu, Claire
Theory and practise of monotone minimal perfect hashing / Djamal Belazzougui, Rasmus Pagh, Paolo Boldi, Sebastiano Vigna. - In: ACM-SIAM Symposium on discrete algorithms : January 4-6, 2009, New York...
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing (2008)
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, and wish to find a...
On-line Bipartite Matching Made Simple (2008)
Benjamin Birnbaum, Claire Mathieu
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for this problem achieves a...
Improved Approximation Algorithms for Budgeted Allocations (2008)
Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
Abstract. We provide a 3/2-approximation algorithm for an offline budgeted allocations problem, an improvement over the e/(e − 1) approximation of Andelman and Mansour [1] and the e/(e − 1) −...
Glencora Borradaile, Philip N. Klein, Claire Mathieu
Steiner tree in planar graphs: An O(n log n)
An O(n log n) Approximation Scheme for Steiner Tree in Planar Graphs (2007)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
We give an O(n log n) approximation scheme for the Steiner tree problem in planar graphs. 1
Thesis (Ph. D.)--Université de Paris-sud, Centre D'Orsay, 1988.
On Best-Response Bidding in GSP Auctions
Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, ...
How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN? We model ad auctions as a dynamic game of incomplete information, so we can study the convergence and...