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. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 79-88, SIAM, 2007. [doi]

Authors

Fabián A. Chudak

This author has not been identified. Look up 'Fabián A. Chudak' in Google

Kiyohito Nagano

This author has not been identified. Look up 'Kiyohito Nagano' in Google