DBScholar

Back to papers

Approximation Algorithms for Co-Clustering

Summary: First provable approximation algorithms for co-clustering: simple algorithms achieving constant-factor approximations for simultaneous row/column partitioning of matrices. Also prove co-clustering NP-hard, moving the problem from heuristics to rigorous algorithmic footing. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1459
Venue
PODS
Year
2008
Pagerank
5.2755515e-05
Overall Rank
9,402 | 35.50%
DOI
10.1145/1376916.1376945

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{anagnostopoulos_pods08,
        address = {New York, NY, USA},
        series = {{PODS} '08},
        title = {{Approximation Algorithms for Co-Clustering}},
        url = {https://dl.acm.org/doi/10.1145/1376916.1376945},
        doi = {10.1145/1376916.1376945},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Anagnostopoulos, Aris and Dasgupta, Anirban and Kumar, Ravi},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,371 Effective Data Co-Reduction for Multimedia Similarity Search 2011 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
6,110 Clustering via Matrix Powering 2004 PODS 5.9728946e-05
13,810 Programmable Clustering 2006 PODS -
Previous Page 1 / 1 Next

Semantically Similar Papers