On Two Segmentation Problems

DOI10.1006/JAGM.1999.1024MaRDI QIDQ4939612zbMATH OpenOpenAlexFDO

Authors Noga Alon, Benny Sudakov

Publication date 13 June 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.8100

zbMATH Keywords

hypercube segmentation problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
• Segmentation problems
• scientific article; zbMATH DE number 1775433
• scientific article; zbMATH DE number 1305507
• Approximating the 2-catalog segmentation problem using semidefinite programming relaxations

Cited in

(13)

• Clustering Boolean tensors
• The graph segmentation problem
• Lossy kernelization of same-size clustering
• Parameterized low-rank binary matrix approximation
• The uniqueness as a generic property for some one-dimensional segmentation problems
• Finding the Rare Cube
• scientific article; zbMATH DE number 1775433 (Why is no real title available?)
• Parameterized low-rank binary matrix approximation
• scientific article; zbMATH DE number 7378704 (Why is no real title available?)
• Segmentation problems
• Data reduction for weighted and outlier-resistant clustering
• Lossy kernelization of same-size clustering
• Upper bound for the approximation ratio of a class of hypercube segmentation algorithms

This page was built for publication: On Two Segmentation Problems

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