Skip to search formSkip to main contentSkip to account menu

Metric k-center

Known as: K-center, Minimum k-center 
In graph theory, the metric k-center or metric facility location problem is a combinatorial optimization problem studied in theoretical computer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Approximation algorithmDominating setFacility location problemFarthest-first traversal

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Fair k-Center Clustering for Data Summarization
In data summarization we want to choose $k$ prototypes in order to summarize a data set. We study a setting where the data set… 
Highly Cited
2019
Highly Cited
2019
Fair Algorithms for Clustering
We study the problem of finding low-cost Fair Clusterings in data where each data point may belong to many protected groups. Our… 
Highly Cited
2018
Highly Cited
2018
Fair Clustering Through Fairlets
We study the question of fair clustering under the {\em disparate impact} doctrine, where each protected class must have… 
Highly Cited
2018
Highly Cited
2018
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially
Center-based clustering is a fundamental primitive for data analysis and becomes very challenging for large datasets. In this… 
Highly Cited
2006
Highly Cited
2006
Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k-Center Problem
Attribute data and relationship data are two principle types of data, representing the intrinsic and extrinsic properties of… 
Highly Cited
2002
Highly Cited
2002
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets… 
Highly Cited
2001
Highly Cited
2001
Algorithms for facility location problems with outliers
Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A… 
Highly Cited
2001
Highly Cited
2001
Efficiently monitoring bandwidth and latency in IP networks
Effective monitoring of network utilization and performance indicators is a key enabling technology for proactive and reactive… 
Highly Cited
1986
Highly Cited
1986
A unified approach to approximation algorithms for bottleneck problems
In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete… 
Highly Cited
1985
Highly Cited
1985
A Best Possible Heuristic for the k-Center Problem
In this paper we present a 2-approximation algorithm for the k-center problem with triangle inequality. This result is “best… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)