pith. sign in

Title resolution pending

· 2019

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.OC 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

On the power of linear programming for K-means clustering

math.OC · 2024-02-01 · conditional · novelty 5.0

An LP relaxation for K-means is shown to be tight under sufficient conditions for two clusters with recovery guarantees under a stochastic model, plus a scalable cutting-plane algorithm for n up to 4000.

citing papers explorer

Showing 1 of 1 citing paper.

  • On the power of linear programming for K-means clustering math.OC · 2024-02-01 · conditional · none · ref 10

    An LP relaxation for K-means is shown to be tight under sufficient conditions for two clusters with recovery guarantees under a stochastic model, plus a scalable cutting-plane algorithm for n up to 4000.