Upper bound for the approximation ratio of a class of hypercube segmentation algorithms

DOI10.1016/J.IPL.2004.10.006zbMath1173.68870OpenAlexW1964457576MaRDI QIDQ835011

Jouni K. Seppänen

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.006

zbMATH Keywords

clusteringcombinatorial problemsdata miningapproximation algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

Clustering Boolean tensors

Cites Work

• On Two Segmentation Problems
• Segmentation problems

This page was built for publication: Upper bound for the approximation ratio of a class of hypercube segmentation algorithms