Deterministic pivoting algorithms for constrained ranking and clustering problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 405-414

  Van Zuylen, Anke ^a   Hegde, Rajneesh ^b   Jain, Kamal ^c   Williamson, David P ^a  

^a Cornell University   (United States)

^b MICROSOFT   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS;

COMBINATORIAL ALGORITHM; CORRELATION CLUSTERING; DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROXIMATION; FEEDBACK ARC SET IN TOURNAMENTS; HIER-ARCHICAL CLUSTERING; PROBABILITY CONSTRAINTS; RANDOMIZED APPROXIMATION;

CLUSTERING ALGORITHMS;

EID: 57249091989     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. N. Ailon and M. Charikar. Fitting tree metrics: Hierarchical clustering and phylogeny. In FOCS 2005, pages 73-82.
2. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In STOC 2005, pages 684-693.
3. M. Chudnovsky, P. Seymour, and B. Sullivan. Cycles in dense digraphs. Submitted, 2006.
4. D. Coppersmith, L. Fleischer, and A. Rudra. Ordering by weighted number of wins gives a good ranking for weighted tournaments. In SODA 2006, pages 776-782.
5. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In WWW 2001, pages 613-622.
6. V. Filkov and S. Skiena. Integrating microarray data by consensus clustering. In ICTAI 2003, pages 418-425.
7. J. Kemeny. Mathematics without numbers. Daedalus, 88:575-591, 1959.
8. M. Krivelevich. On a conjecture of Tuza about packing and covering of triangles. Discrete Mathematics, 142:281-286, 1995.
9. B. D. Sullivan. A summary of results and problems related to the Caccetta-Häggkvist conjecture. URL: http://www.aimath.org/WWN/caccetta/caccetta.pdf, April 2006.