On computing centroids according to the p-norms of Hamming distance vectors

DOI10.4230/LIPICS.ESA.2019.28MaRDI QIDQ5075765FDOQ5075765

Authors: Jiehua Chen, Danny Hermelin, Manuel Sorge 

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1807.06469

Recommendations

• Approximation algorithms for Hamming clustering problems
• On the Efficiency of the Hamming C-Centerstring Problems
• scientific article; zbMATH DE number 1615274
• scientific article; zbMATH DE number 1305511
• Combinatorial Pattern Matching

zbMATH Keywords

clusteringHamming distancestringsmultiwinner election

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Distinguishing string selection problems.
• More efficient algorithms for closest string and substring problems
• A three-string approach to the closest string problem
• Title not available (Why is that?)
• Parameterized algorithms
• On covering problems of codes
• Title not available (Why is that?)
• Introduction to Coding Theory
• The linear regression model: L_pnorm estimation and the choice of p
• Title not available (Why is that?)
• Approval balloting for multi-winner elections
• Title not available (Why is that?)
• All-norm approximation algorithms
• On the parameterized complexity of consensus clustering
• Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
• Combinatorial \(n\)-fold integer programming and applications
• Parametric Facility Location on a Tree Network with an L_p-Norm Cost Function
• Algorithms and hardness for subspace approximation
• Lower bounds for approximation schemes for Closest String
• A polynomial-time descent method for separable convex optimization problems with linear constraints
• How hard is it to satisfy (almost) all roommates?
• Bypassing UGC from some optimal geometric inapproximability results

Cited In (4)

• A note on clustering aggregation for binary clusterings
• Consensus strings with small maximum distance and small distance sum
• The Fréchet mean of inhomogeneous random graphs
• On the parameterized complexity of clustering problems for incomplete data

This page was built for publication: On computing centroids according to the \(p\)-norms of Hamming distance vectors

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