Publication | Closed Access

Fast approximations for sums of distances, clustering and the Fermat–Weber problem

EngineeringGeometric AlgorithmFermat–weber ProblemCombinatorial ProblemComputational ComplexityApproximation MethodFast ApproximationsCombinatorial OptimizationApproximation Theory