Skip to content

Author

A. Srinivasan

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Edge-colored Clustering in Hypergraphs: A MaxECC Approximation

This work exponentially improves upon the approximation ratio of an existing algo-rithm to 1 r +1, presents another novel dependent-rounding algorithm with an approximation ratio of 1 / ⌈ k 2 ⌉, and modify the initial algorithm via analytical scaling techniques to achieve an approximation factor of (1 − e − r ) /r.

Aravind Srinivasan, A. Srinivasan, Jiayi Wu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.