10 citations · 21 across the 16 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Improved linearly ordered colorings of hypergraphs via SDP rounding
Anand Louis, Alantha Newman, Arka Ray
We consider the problem of linearly ordered (LO) coloring of hypergraphs. A hypergraph has an LO coloring if there is a vertex coloring, using a set of ordered colors, so that (i)…
cs.DS2024★ 10 cited
Understanding the Cluster LP for Correlation Clustering
Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee +3
In the classic Correlation Clustering problem introduced by Bansal, Blum, and Chawla (FOCS 2002), the input is a complete graph where edges are labeled either or , and the g…