A polynomial-sized convex relaxation for weighted Nash social welfare achieves e^{1/e} approximation and provides simpler proofs for related fair allocation and scheduling problems.
Estimating the Nash Social Welfare for coverage and other submodular valuations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New Convex Programming Technique for Nash Social Welfare and Scheduling
A polynomial-sized convex relaxation for weighted Nash social welfare achieves e^{1/e} approximation and provides simpler proofs for related fair allocation and scheduling problems.