2
votes
Accepted
Balanced set coloring
I think this question is closely related to the term discrepancy.
Here is the defintion.
Given a universe $U$ a collection of sets $\mathcal{A}=\{S_i\}$ and a function $\varphi:U\to\{-1,1\}$. For $S\...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
graph-colouring × 125graph-theory × 64
cc.complexity-theory × 29
graph-algorithms × 27
co.combinatorics × 15
ds.algorithms × 14
np-hardness × 14
planar-graphs × 14
reference-request × 13
approximation-algorithms × 9
approximation-hardness × 9
hypergraphs × 8
bounded-degree × 6
time-complexity × 5
graph-isomorphism × 4
counting-complexity × 3
np-complete × 3
set-cover × 3
clique × 3
independent-set × 3
lower-bounds × 2
dc.distributed-comp × 2
parameterized-complexity × 2
polynomial-time × 2
open-problem × 2