23.6k citations
- Google (United States)US44 papers
- ETH ZurichCH19 papers
- École Polytechnique Fédérale de LausanneCH11 papers
- Technical University of MunichDE11 papers
- Ames Research CenterUS8 papers
- BMW Group (Germany)DE5 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Durham UniversityGB5 papers
- Google (United Kingdom)GB5 papers
- Johns Hopkins UniversityUS5 papers
- Sapienza University of RomeIT4 papers
- University College LondonGB4 papers
6 papers · 1 filter
Fully Dynamic Submodular Maximization over Matroids
Paul Dütting, Federico Fusco, Silvio Lattanzi +2
Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this c…
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis +2
We consider the numerical taxonomy problem of fitting a positive distance function by a tree metric. We want a tree with positive e…
A New Coreset Framework for Clustering
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
Given a metric space, the -clustering problem consists of finding centers such that the sum of the of distances raised to the power of every point to its closest cen…
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity
Matthew Fahrbach, Vahab Mirrokni, Morteza Zadimoghaddam
Submodular optimization generalizes many classic problems in combinatorial optimization and has recently found a wide range of applications in machine learning (e.g., feature engin…
Optimal Indexes for Sparse Bit Vectors
Alexander Golynski, Alessio Orlandi, Rajeev Raman +1
We consider the problem of supporting Rank() and Select() operations on a bit vector of length m with n 1 bits. The problem is considered in the succinct index model, where the bit…
Finding total unimodularity in optimization problems solved by linear programs
Christoph Durr, Mathilde Hurand
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happe…