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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Static and dynamic clustering algorithms are a fundamental tool in any machine learning library. Most of the efforts in… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 5
Is this relevant?
2017
2017
Solving geometric optimization problems over uncertain da ta has become increasingly important in many applications and has… (More)
  • figure 1
Is this relevant?
2017
2017
The problem of constrained k-center clustering has attracted significant attention in the past decades. In this paper, we study… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2016
2016
The k-center problem is a classic NP-hard clustering question. For contemporary massive data sets, RAM-based algorithms become… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 5
Is this relevant?
2016
2016
The k-center problem is a canonical and long-studied facility location and clustering problem with many applications in both its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each… (More)
  • figure 1
  • figure 2
Is this relevant?
2014
2014
We consider variants of the metric k-center problem. Imagine that you must choose locations for k firehouses in a city so as to… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Clustering under most popular objective functions is NP-hard, even to approximate well, and so unlikely to be efficiently… (More)
  • figure 2
  • figure 3
Is this relevant?
2003
2003
In the ASYMMETRIC <i>k</i>-CENTER problem, the input is an integer <i>k</i> and a complete digraph over <i>n</i> points together… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of… (More)
Is this relevant?