Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
The Newton Bracketing Method for Convex Minimization
Computational Optimization and Applications
Fast approximations for sums of distances, clustering and the Fermat--Weber problem
Computational Geometry: Theory and Applications
Efficient subspace approximation algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matching point sets with respect to the Earth Mover's Distance
Computational Geometry: Theory and Applications
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On stars and Steiner stars: II
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The projection median of a set of points
Computational Geometry: Theory and Applications
Single facility collection depots location problem in the plane
Computational Geometry: Theory and Applications
On the Fermat--Weber center of a convex object
Computational Geometry: Theory and Applications
New algorithms for 1-D facility location and path equipartition problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Robot networks with homonyms: the case of patterns formation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Efficient algorithms for detecting regular point configurations
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Matching point sets with respect to the earth mover’s distance
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating generalized distance functions on weighted triangulated surfaces with applications
Journal of Computational and Applied Mathematics
Discrete Optimization
Facility location problems with uncertainty on the plane
Discrete Optimization
| Hi-index | 0.00 |