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
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 54 citations. REVIEW CITATIONS
37 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

55 Citations

0510'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov Random Fields

  • Jon Kleinberg andÉva Tardos
  • In Proceedings of the 40th Annual IEEE Symposium…
  • 1999
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…