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

Information Processing Letters

Volumn 93, Issue 3, 2005, Pages 139-141

  Seppänen, Jouni K ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Approximation algorithms; Clustering; Combinatorial problems; Data mining

Indexed keywords

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COMBINATORIAL MATHEMATICS; DATA MINING; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; VECTORS;

APPROXIMATION ALGORITHMS; CLUSTERING; COMBINATORIAL PROBLEMS; HYPERCUBE SEGMENTATION;

ALGORITHMS;

EID: 10444255508     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.10.006     Document Type: Article

References (2)

1. J. Kleinberg, C. Papadimitriou, P. Raghavan, Segmentation problems, J. ACM 51 (2) (2004) 263-280.
2. N. Alon, B. Sudakov, On two segmentation problems, J. Algorithms 33 (1) (1999) 173-184.