Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
From MaRDI portal
Publication:835011
DOI10.1016/J.IPL.2004.10.006zbMath1173.68870OpenAlexW1964457576MaRDI QIDQ835011
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
Related Items (1)
Cites Work
This page was built for publication: Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
