An accelerated continuous greedy algorithm for maximizing strong submodular functions

Zengfu Wang (), Bill Moran (), Xuezhi Wang () and Quan Pan ()
Additional contact information
Zengfu Wang: Northwestern Polytechnical University
Bill Moran: University of Melbourne
Xuezhi Wang: University of Melbourne
Quan Pan: Northwestern Polytechnical University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 19, 1107-1124

Abstract: Abstract An accelerated continuous greedy algorithm is proposed for maximization of a special class of non-decreasing submodular functions $$f:2^{X} \rightarrow \mathfrak {R}_{+}$$ f : 2 X → R + subject to a matroid constraint with a $$\frac{1}{c} (1 - e^{-c} - \varepsilon ) $$ 1 c ( 1 - e - c - ε ) approximation for any $$\varepsilon > 0$$ ε > 0 , where $$c$$ c is the curvature with respect to the optimum. Functions in the special class of submodular functions satisfy the criterion $$\forall A, B \subseteq X,\, \forall j \in X {\setminus } (A \cup B)$$ ∀ A , B ⊆ X , ∀ j ∈ X \ ( A ∪ B ) , $$\triangle f_j(A,B) \mathop {=}\limits ^{\Delta } f(A \cup \{j\}) + f(B \cup \{j\}) - f((A \cap B) \cup \{j\}) - f(A \cup B \cup \{j\}) - [f(A) + f(B) - f(A \cap B) - f(A \cup B)] \le 0$$ ▵ f j ( A , B ) = Δ f ( A ∪ { j } ) + f ( B ∪ { j } ) - f ( ( A ∩ B ) ∪ { j } ) - f ( A ∪ B ∪ { j } ) - [ f ( A ) + f ( B ) - f ( A ∩ B ) - f ( A ∪ B ) ] ≤ 0 . As an alternative to the standard continuous greedy algorithm, the proposed algorithm can substantially reduce the computational expense by removing redundant computational steps and, therefore, is able to efficiently handle the maximization problems for this special class of submodular functions. Examples of such functions are presented.

Keywords: Monotone submodular set function; Matroid; Approximation algorithm (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9685-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-013-9685-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9685-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().