Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lov√°sz extension and non-smooth convex optimization.
(xsd:string)
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lov√°sz extension and non-smooth convex optimization.
(xsd:string)