An accelerated continuous greedy algorithm for maximizing strong submodular functions

An accelerated continuous greedy algorithm is proposed for maximization of a special class of non-decreasing submodular functions f : 2 X → R + subject to a matroid constraint with a 1 c ( 1 - e - c - ε ) approximation for any ε > 0 , where c is the curvature with respect to the optimum. Function...

Full description

Bibliographic Details

Published in:	Journal of combinatorial optimization Vol. 30; no. 4; pp. 1107 - 1124
Main Authors:	Wang, Zengfu, Moran, Bill, Wang, Xuezhi, Pan, Quan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2015
Subjects:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Approximation algorithm Monotone submodular set function Matroid
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!