vix.ing · top · new · best · stats · spec

Mathieu, Claire

  1. Hierarchical Clustering: Objective Functions and Algorithms
    2017/04/07 by Vincent Cohen-Addad, Varun Kanade, Cohen-Addad, Vincent +5 · 20 citations
    Computer Science · #Advanced Clustering Algorithms Research #Bayesian Methods and Mixture Models #Data Management and Algorithms
  2. Graph Reconstruction via Distance Oracles
    2013/04/24 by Mathieu, Claire, Zhou, Hang · 3 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  3. A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
    2008/12/08 by Aparna Das, Das, Aparna, Claire Mathieu +1 · 1 citation
    Business, Management and Accounting · Computer Science · Engineering · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Facility Location and Emergency Management #Vehicle Routing Optimization Methods
  4. Online Correlation Clustering
    2010/01/06 by Claire Mathieu, Ocan Sankur, Mathieu, Claire +3 · 1 citation
    Computer Science · #Advanced Clustering Algorithms Research #Bayesian Methods and Mixture Models #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences
  5. Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
    2010/07/08 by Karlin, Anna R., Mathieu, Claire, Nguyen, C. Thach · 1 citation
    #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
  6. An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
    2011/10/06 by David D. Eisenstat, Eisenstat, David, Philip Α. Klein +3 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  7. Apportionment with Parity Constraints
    2021/08/09 by Claire Mathieu, Mathieu, Claire, Víctor Verdugo +1 · 2 citations
    Business, Management and Accounting · Mathematics · #Analytic Number Theory Research #Computers and Society (cs.CY) #Consumer Market Behavior and Pricing #FOS: Computer and information sciences #FOS: Mathematics #Mathematics and Applications #Optimization and Control (math.OC)
  8. Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics
    2016/03/31 by Cohen-Addad, Vincent, Klein, Philip N., Mathieu, Claire · 1 citation
    #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  9. Maximum Matching in Semi-Streaming with Few Passes
    2011/12/01 by Konrad, Christian, Magniez, Frédéric, Mathieu, Claire · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  10. A PTAS for Capacitated Vehicle Routing on Trees
    2021/11/05 by Claire Mathieu, Hang Zhou, Mathieu, Claire +1 · 1 citation
    Computer Science · Engineering · #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graph Theory and Algorithms #Vehicular Ad Hoc Networks (VANETs)
  11. Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm
    2022/09/12 by Fabrizio Grandoni, Grandoni, Fabrizio, Claire Mathieu +3 · 1 citation
    Computer Science · Engineering · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #Vehicle Routing Optimization Methods
  12. A tree structure for dynamic facility location *
    2019/09/14 by Monika Henzinger, Goranci, Gramoz, Dariusz Leniowski +3 · 1 citation
    Computer Science · Engineering · #3D Modeling in Geospatial Applications #Advanced Manufacturing and Logistics Optimization #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  13. Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
    2018/06/21 by Vincent Cohen-Addad, Cohen-Addad, Vincent, Frederik Mallmann-Trenn +3 · 1 citation
    Computer Science · #Data Structures and Algorithms (cs.DS) #Databases (cs.DB) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning and Algorithms #Mobile Crowdsensing and Crowdsourcing #Optimization and Search Problems
  14. Rotation distance using flows
    2024/09/26 by Mathieu, Claire, Thurston, William · 1 citation
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.m