A continuous facility location problem and its application to a clustering problem (original) (raw)

Clustering through Continuous Facility Location Problems

Luis Meira

Theoretical Computer Science, 2017

View PDFchevron_right

Approximation Algorithms for Clustering and Facility Location Problems

Sara Ahmadian

2017

View PDFchevron_right

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median

Chris Schwiegelshohn

Cornell University - arXiv, 2022

View PDFchevron_right

Approximation algorithms for the k-center problem: an experimental evaluation

Khadija Benhamou

View PDFchevron_right

Faster Algorithms for the Constrained k-means Problem

Amit Kumar

Theory of Computing Systems, 2017

View PDFchevron_right

ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS

Piyush kumar

International Journal of Computational Geometry & Applications, 2010

View PDFchevron_right

Primal-Dual Algorithms for Connected Facility Location Problems

Amit Kumar

2002

View PDFchevron_right

The k-centrum multi-facility location problem

Arie Tamir

Discrete Applied Mathematics, 2001

View PDFchevron_right

Squared Metric Facility Location Problem

Luis Meira

2011

View PDFchevron_right

Two unconstrained optimization approaches for the Euclidean κ-centrum location problem

Jein-Shan Chen

Applied Mathematics and Computation, 2007

View PDFchevron_right

On Approximability of Clustering Problems Without Candidate Centers

Karthik karthik

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

View PDFchevron_right

A Survey on Exact and Approximation Algorithms for Clustering

kushal jain

View PDFchevron_right

Compact location problems

Daniel Rosenkrantz

Lecture Notes in Computer Science, 1993

View PDFchevron_right

Linear-time approximation schemes for clustering problems in any dimensions

amit kumar

Journal of The ACM, 2010

View PDFchevron_right

On Euclidean k-Means Clustering with α-Center Proximity

Apoorv Singh

2019

View PDFchevron_right

Approximation algorithms for clustering problems

David Shmoys

Computational Learning Theory, 1999

View PDFchevron_right

A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances

Paul Calamai

SIAM Journal on Scientific and Statistical Computing, 1980

View PDFchevron_right

Globally Optimal Facility Locations for Continuous-Space Facility Location Problems

Xuehong Gao

Applied Sciences, 2021

View PDFchevron_right

A novel approach to solve K-center problems with geographical placement

Peter Hillmann

2015 IEEE International Conference on Service Operations And Logistics, And Informatics (SOLI), 2015

View PDFchevron_right

Approximation Algorithms for Metric Facility Location Problems

Mohammad Mahdian

Siam Journal on Computing, 2006

View PDFchevron_right

Minimizing Differences of Convex Functions with Applications to Facility Location and Clustering

Mau Nguyen

Journal of Optimization Theory and Applications, 2017

View PDFchevron_right

On Euclidean k-Means Clustering with alpha-Center Proximity

Apoorv Singh

2019

View PDFchevron_right

The single facility location problem with minimum distance constraints

Arie Tamir

Location Science, 1997

View PDFchevron_right

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Sara Ahmadian

arXiv (Cornell University), 2016

View PDFchevron_right

Linear time algorithms for clustering problems in any dimensions

amit kumar

2005

View PDFchevron_right

Fully Dynamic Consistent Facility Location

Chris Schwiegelshohn

2019

View PDFchevron_right