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]
@inproceedings{ChudakN07, title = {Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization}, author = {Fabián A. Chudak and Kiyohito Nagano}, year = {2007}, doi = {10.1145/1283383.1283393}, url = {http://doi.acm.org/10.1145/1283383.1283393}, tags = {optimization}, researchr = {https://researchr.org/publication/ChudakN07}, cites = {0}, citedby = {0}, pages = {79-88}, booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007}, editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, publisher = {SIAM}, isbn = {978-0-898716-24-5}, }