Lossy kernelization of same-size clustering (Q2097218)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Lossy kernelization of same-size clustering

scientific article; zbMATH DE number 7615733

Language	Label	Description	Also known as
default for all languages	No label defined
English	Lossy kernelization of same-size clustering	scientific article; zbMATH DE number 7615733

Statements

instance of

scholarly article

0 references

title

Lossy kernelization of same-size clustering (English)

0 references

0 references

0 references

0 references

0 references

0 references

11 November 2022

0 references

full work available at URL

https://arxiv.org/abs/2107.07383

0 references

zbMATH Keywords

k-median clustering

0 references

parameterized approximation

0 references

kernelization

0 references

lossy kernels

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the parameterized complexity of contraction to generalization of trees

0 references

Better guarantees for $k$-means and Euclidean $k$-median by primal-dual algorithms

0 references

On Two Segmentation Problems

0 references

Q4542527

0 references

On variants of $k$-means clustering

0 references

Constrained Clustering

0 references

Faster algorithms for the constrained $k$-means problem

0 references

Bi-factor approximation algorithms for hard capacitated $k$-median problems

0 references

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

0 references

An approximation algorithm for uniform capacitated $k$-median problem with $1+\epsilon$ capacity violation

0 references

A constant-factor approximation algorithm for the $k$-median problem

0 references

Approximating $k$-median with non-uniform capacities

0 references

Approximation Schemes for Capacitated Clustering in Doubling Metrics

0 references

Q5091192

0 references

Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics

0 references

On the fixed-parameter tractability of capacitated clustering

0 references

Effectiveness of local search for geometric optimization

0 references

Q4607908

0 references

Parameterized algorithms

0 references

Kernelization of packing problems

0 references

Constant approximation for capacitated $k$-median with $(1+\epsilon)$-capacity violation

0 references

A unified framework for clustering constrained data without locality property

0 references

Fundamentals of parameterized complexity

0 references

Parameterized approximation schemes for Steiner trees with small number of Steiner vertices

0 references

Lossy kernels for connected dominating set on sparse graphs

0 references

A unified framework for approximating and clustering data

0 references

Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering

0 references

A unified framework of FPT approximation algorithms for clustering problems

0 references

Parameterized low-rank binary matrix approximation

0 references

Kernelization. Theory of parameterized preprocessing

0 references

Local search yields a PTAS for $k$-means in doubling metrics

0 references

On coresets for k-means and k-median clustering

0 references

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

0 references

Lossy kernels for graph contraction problems

0 references

Linear-time approximation schemes for clustering problems in any dimensions

0 references

On uniform capacitated $k$-median beyond the natural LP relaxation

0 references

Approximating $k$-median via pseudo-approximation

0 references

Lossy kernelization

0 references

A birthday repetition theorem and complexity of approximating dense CSPs

0 references

The hardness of approximation: Gap location

0 references

k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY

0 references

Identifiers

DOI

10.1007/978-3-031-09574-0_7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2097218