Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Maximizing profit using recommender systems
No associations
LandOfFree
Claire Mathieu does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Claire Mathieu, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Claire Mathieu will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-150584