Date of Original Version

5-2000

Type

Conference Proceeding

Abstract or Description

In a traditional classification problem, we wish to assign labels from a set L to each of n objects so that the labeling is consistent with some observed data that includes pairwise relationships among the objects. Kleinberg and Tardos recently formulated a general classification problem of this type, the “metric labeling problem”, and gave an O(logjLlogjL) approximation algorithm for it. The algorithm is based on solving a linear programming relaxation of a natural integer program and then randomized rounding.

DOI

10.1145/335305.335397

Share

COinS
 

Published In

Proceedings of the Thirty-Second Annual ACM Symposium on theory of Computing . STOC '00., 652-658.