On Two Segmentation Problems

DOI10.1006/JAGM.1999.1024zbMath0937.68136OpenAlexW2102427192MaRDI QIDQ4939612

Noga Alon, Benjamin 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

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

Related Items (8)

Upper bound for the approximation ratio of a class of hypercube segmentation algorithms ⋮ Unnamed Item ⋮ Clustering Boolean tensors ⋮ Parameterized low-rank binary matrix approximation ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ Lossy kernelization of same-size clustering ⋮ Lossy kernelization of same-size clustering ⋮ Unnamed Item

This page was built for publication: On Two Segmentation Problems