Pith. sign in

35 CHAKRABORTYCHATTERJEEDASNGUYENNOBAHARI For proving Theorem 24, we need the help of the following proposition

if s(D i)> p/2thenOPT Di ≥(p−s(D i))(|Di| −s(Di)) +1 2 s(Di)(p−s(D i))

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

citation-role summary

method 1

citation-polarity summary

use method 1

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

method 1

polarities

use method 1

representative citing papers

Towards Fair Representation: Clustering and Consensus

cs.LG · 2025-06-10 · conditional · novelty 7.0

For two-color data, the paper provides the first constant-factor approximation algorithms for closest fair clustering and for fair consensus clustering under the generalized mean objective.

citing papers explorer

Showing 1 of 1 citing paper.

  • Towards Fair Representation: Clustering and Consensus cs.LG · 2025-06-10 · conditional · none · ref 2

    For two-color data, the paper provides the first constant-factor approximation algorithms for closest fair clustering and for fair consensus clustering under the generalized mean objective.