A constant factor approximation algorithm for a class of classification problems

@inproceedings{Gupta2000ACF,
title={A constant factor approximation algorithm for a class of classification problems},
author={Anupam Gupta and {\'E}va Tardos},
booktitle={STOC},
year={2000}
}

In a traditional classification problem, we wish to assign la bels from a set L to each ofn objects so that the labeling is consistent with some observed data that includes pairwise r elationships among the objects. Kleinberg and Tardos recent ly formulated a general classification problem of this type, th “metric labeling problem”, and gave an O(log jLj log log jLj) approximation algorithm for it. The algorithm is based on solving a linear programming relaxation of a natural intege r program… CONTINUE READING