Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovsz extension and non-smooth convex optimization.

Fabin A. Chudak, Kiyohito Nagano

Browse the full SODA paper archive.