Approximation for maximizing monotone non-decreasing set functions with a greedy method

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

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 3, 29-43

Abstract: Abstract We study the problem of maximizing a monotone non-decreasing function $$f$$ f subject to a matroid constraint. Fisher, Nemhauser and Wolsey have shown that, if $$f$$ f is submodular, the greedy algorithm will find a solution with value at least $$\frac{1}{2}$$ 1 2 of the optimal value under a general matroid constraint and at least $$1-\frac{1}{e}$$ 1 - 1 e of the optimal value under a uniform matroid $$(\mathcal {M} = (X,\mathcal {I})$$ ( M = ( X , I ) , $$\mathcal {I} = \{ S \subseteq X: |S| \le k\}$$ I = { S ⊆ X : | S | ≤ k } ) constraint. In this paper, we show that the greedy algorithm can find a solution with value at least $$\frac{1}{1+\mu }$$ 1 1 + μ of the optimum value for a general monotone non-decreasing function with a general matroid constraint, where $$\mu = \alpha $$ μ = α , if $$0 \le \alpha \le 1$$ 0 ≤ α ≤ 1 ; $$\mu = \frac{\alpha ^K(1-\alpha ^K)}{K(1-\alpha )}$$ μ = α K ( 1 - α K ) K ( 1 - α ) if $$\alpha > 1$$ α > 1 ; here $$\alpha $$ α is a constant representing the “elemental curvature” of $$f$$ f , and $$K$$ K is the cardinality of the largest maximal independent sets. We also show that the greedy algorithm can achieve a $$1 - (\frac{\alpha + \cdots + \alpha ^{k-1}}{1+\alpha + \cdots + \alpha ^{k-1}})^k$$ 1 - ( α + ⋯ + α k - 1 1 + α + ⋯ + α k - 1 ) k approximation under a uniform matroid constraint. Under this unified $$\alpha $$ α -classification, submodular functions arise as the special case $$0 \le \alpha \le 1$$ 0 ≤ α ≤ 1 .

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

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9707-3 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:31:y:2016:i:1:d:10.1007_s10878-014-9707-3

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

DOI: 10.1007/s10878-014-9707-3

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 ().