Faster balanced clusterings in high dimension (Q2006774)

From MaRDI portal

Revision as of 19:57, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster balanced clusterings in high dimension	scientific article

Statements

scholarly article

0 references

Faster balanced clusterings in high dimension (English)

0 references

0 references

Theoretical Computer Science

0 references

publication date

12 October 2020

0 references

full work available at URL

https://arxiv.org/abs/1809.00932

0 references

zbMATH Keywords

balanced clustering

0 references

\(k\)-center

0 references

\(k\)-median

0 references

\(k\)-means

0 references

high dimension

0 references

MaRDI profile type

MaRDI publication profile

0 references

Achieving anonymity via clustering

0 references

Improved Approximation Guarantees for Lower-Bounded Facility Location

0 references

Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers

0 references

Centrality of trees for capacitated \(k\)-center

0 references

0 references

Local Search Heuristics for <i>k</i>-Median and Facility Location Problems

0 references

0 references

0 references

Approximate clustering via core-sets

0 references

How to Allocate Network Centers

0 references

Faster algorithms for the constrained \(k\)-means problem

0 references

An LP-based \(k\)-means algorithm for balancing weighted point sets

0 references

An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization

0 references

Improved Combinatorial Algorithms for Facility Location Problems

0 references

On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications

0 references

Capacitated center problems with two-sided bounds and outliers

0 references

A Unified Framework for Clustering Constrained Data without Locality Property

0 references

Cutting dense point sets in half

0 references

A unified framework for approximating and clustering data

0 references

Clustering to minimize the maximum intercluster distance

0 references

0 references

A Best Possible Heuristic for the <i>k</i>-Center Problem

0 references

Sublinear time algorithms for metric space problems

0 references

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems

0 references

Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems

0 references

A local search approximation algorithm for \(k\)-means clustering

0 references

The Capacitated <i>K</i>-Center Problem

0 references

Constant Factor Approximation for Capacitated k-Center with Outliers

0 references

A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem

0 references

Linear-time approximation schemes for clustering problems in any dimensions

0 references

On Uniform Capacitated <i>k</i> -Median Beyond the Natural LP Relaxation

0 references

Approximating $k$-Median via Pseudo-Approximation

0 references

The planar \(k\)-means problem is NP-hard

0 references

On the Complexity of Some Common Geometric Location Problems

0 references

Max flows in O(nm) time, or better

0 references

0 references

k-means requires exponentially many iterations even in the plane

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.tcs.2020.07.022

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2006774

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2006774&oldid=36624116"