Deterministic Approximation Algorithms for Ranking and Clustering Problems

@inproceedings{Zuylen2005DeterministicAA,
  title={Deterministic Approximation Algorithms for Ranking and Clustering Problems},
  author={Anke van Zuylen},
  year={2005}
}
We give deterministic versions of randomized approximation algorithms for several ranking and clustering problems that were proposed by Ailon, Charikar and Newman[1]. We show that under a reasonable extension of the triangle inequality in clustering problems, we can resolve Ailon et al.’s open question whether there is an approximation algorithm for weighted correlation clustering with weights satisfying the triangle inequality. 
Highly Cited
This paper has 18 citations. REVIEW CITATIONS
11 Citations
5 References
Similar Papers

References

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

Personal communication

  • Lisa Fleischer.
  • Daedalus
  • 2005

Mathematics without numbers

  • J. G. Kemeny
  • Daedalus, 88:575–591
  • 1959
1 Excerpt

Similar Papers

Loading similar papers…