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

Fabián A. Chudak Kiyohito Nagano Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. 79-88 2007 conf/soda/2007 SODA http://doi.acm.org/10.1145/1283383.1283393 db/conf/soda/soda2007.html#ChudakN07