Resolving conflicts for lower-bounded clustering

DOI10.4230/LIPICS.IPEC.2018.23MaRDI QIDQ5009486zbMATH OpenFDO

Authors Katrin Casel

Publication date 4 August 2021

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2018.23

zbMATH Keywords

clusteringparameterised approximationtriangle inequality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Recommendations

• Clustering with center constraints
• Approximation algorithms for clustering to minimize the sum of diameters
• Approximation algorithms for clustering problems with lower bounds and outliers
• scientific article; zbMATH DE number 1617263
• On minimum sum of radii and diameters clustering

Cites work

• A 1.488 approximation algorithm for the uncapacitated facility location problem
• A fast branching algorithm for cluster vertex deletion
• Analytical approach to parallel repetition
• Clustering with lower-bounded sizes. A general graph-theoretic framework
• Fundamentals of parameterized complexity
• Heuristics for the fixed cost median problem
• scientific article; zbMATH DE number 125608 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Improved bounds on Bell numbers and on moments of sums of random variables
• Improved upper bounds for vertex cover
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
• On the complexity of k-SAT
• On the complexity of some colorful problems parameterized by treewidth
• On the parameterized complexity of multiple-interval graph problems
• Parameterized and Exact Computation
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• Parameterized inapproximability of target set selection and generalizations
• Slightly superexponential parameterized problems
• Strong computational lower bounds via parameterized complexity

Cited in

(5)

• On the complexity of broadcast domination and multipacking in digraphs
• Clustering with center constraints
• 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
• On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs
• Two generalizations of proper coloring: hardness and approximability

This page was built for publication: Resolving conflicts for lower-bounded clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009486)