works on
additive valuations 1approximation algorithms 1combinatorial optimization 1nash social welfare 1theoretical computer science 1

From the 1 of 5 linked papers with an AI index.

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

Equitable Colorings of Vertex-Weighted Graphs

Siddharth Barman, Vignesh Viswanathan

We study a generalization of the classical Hajnal-Szemerédi theorem to vertex-weighted graphs. Given a graph with nonnegative vertex weights, a coloring is called -approximate…