2 papers
cs.DS2024
On Sparsest Cut and Conductance in Directed Polymatroidal Networks
Chandra Chekuri, Anand Louis
We consider algorithms and spectral bounds for sparsest cut and conductance in directed polymatrodal networks. This is motivated by recent work on submodular hypergraphs \cite{Yosh…
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)…