Clustering with qualitative information

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 524-533

  Charikar, M ^a   Guruswami, V ^b   Wirth, A ^a  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Clustering algorithms; Engineering profession; Labeling; US Department of Energy

Indexed keywords

ALUMINUM; CLUSTERING ALGORITHMS; GRAPHIC METHODS; HARDNESS; LABELING; PROFESSIONAL ASPECTS;

APX-HARDNESS; COMPLETE GRAPHS; ENGINEERING PROFESSION; GENERAL GRAPH; GRAPH G; QUALITATIVE INFORMATION; US DEPARTMENT OF ENERGY;

GRAPH THEORY;

EID: 34748911819     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238225     Document Type: Conference Paper

References (13)

1. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. In Proc. of 43rd FOCS, pages 238-47, 2002.
2. G. Calinescu, H. Karloff, and Y. Rabani. An improved approximation algorithm for multiway cut. JCSS, 60:564-74, 2000.
3. E. Demaine and N. Immorlica. Correlation clustering with partial information. In Proc. of 6th APPROX, 2003. To appear.
4. D. Emanuel and A. Fiat. Correlation clustering - minimizing disagreements on arbitrary weighted graphs. In Proc. of 11th ESA, 2003. To appear.
5. G. Even, J. Naor, B. Schieber, and L. Zosin. Approximating minimum subset feedback sets in undirected graphs with applications. SIAM J Disc. Math., 25:255-67, 2000.
6. A. Frieze and M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. In E. Balas and J. Clausen, editors, Proc. of 4th IPCO, volume 920 of LNCS, pages 1-13. Springer, 1995.
7. N. Garg, V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J Comp., 25:235-51, 1996.
8. N. Garg, V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18:3-20, 1997.
9. V. Guruswami. Inapproximability results for set splitting and satisfiability with no mixed clauses. In K. Jansen and S. Khuller, editors, Proc. of 3rd APPROX, volume 1913 of LNCS, pages 155-66. Springer, 2000.
10. J. Håstad. Some optimal inapproximability results. JACM, 48:798-859, 2001.
11. D. Karger, P. Klein, C. Stein, M. Thorup, and N. Young. Rounding algorithms for a geometric embedding of minimum multiway cut. In Proc. of 31st STOC, pages 668-78, 1999.
12. S. Khot. On the power of unique 2-prover 1-round games. In Proc. of 34th STOC, pages 767-75, 2002.
13. C. Papadimitriou. Computational Complexity. Addison Wesley Longman, 1994.