Access the full text.
Sign up today, get DeepDyve free for 14 days.
Naoyuki Kamiyama (2011)
Submodular Function Minimization under a Submodular Set Covering Constraint
J. Edmonds (2001)
Submodular Functions, Matroids, and Certain Polyhedra
M. Grötschel, L. Lovász, A. Schrijver (1981)
The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1
G. Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang (2009)
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions2009 50th Annual IEEE Symposium on Foundations of Computer Science
(2007)
A faster parametric submodular function minimization algorithm and applications
Rishabh Iyer, J. Bilmes (2013)
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
A. Schrijver (2000)
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial TimeJ. Comb. Theory, Ser. B, 80
Zoya Svitkina, L. Fleischer (2008)
Submodular Approximation: Sampling-based Algorithms and Lower Bounds2008 49th Annual IEEE Symposium on Foundations of Computer Science
Rishabh Iyer, S. Jegelka, J. Bilmes (2014)
Monotone Closure of Relaxed Constraints in Submodular Optimization: Connections Between Minimization and Maximization
K. Murota (1998)
Discrete convex analysisMathematical Programming, 83
Z Svitkina, L Fleischer (2011)
Submodular approximation: sampling-based algorithms and lower boundsSIAM J. Comput., 40
S. Iwata, Kiyohito Nagano (2009)
Submodular Function Minimization under Covering Constraints2009 50th Annual IEEE Symposium on Foundations of Computer Science
Yotaro Takazawa, S. Mizuno (2017)
A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPHJournal of The Operations Research Society of Japan, 60
Christos Koufogiannakis, N. Young (2013)
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular CostAlgorithmica, 66
Tim Carnes, D. Shmoys (2008)
Primal-dual schema for capacitated covering problemsMathematical Programming, 153
F. Bach (2011)
Learning with Submodular Functions: A Convex Optimization PerspectiveFound. Trends Mach. Learn., 6
D. Hochbaum (2010)
Submodular problems - approximations and algorithmsArXiv, abs/1010.1945
M. Queyranne (1998)
Minimizing symmetric submodular functionsMathematical Programming, 82
S. Iwata, L. Fleischer, S. Fujishige (2000)
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
C Koufogiannakis, NE Young (2013)
Greedy $${\varDelta }$$ Δ -approximation algorithm for covering with arbitrary constraints and submodular costAlgorithmica, 66
M. Grötschel, L. Lovász, A. Schrijver (1988)
Geometric Algorithms and Combinatorial Optimization, 2
K. Murota (2003)
Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10
R. Carr, L. Fleischer, V. Leung, C. Phillips (2000)
Strengthening integrality gaps for capacitated network design and covering problems
Rishabh Iyer, S. Jegelka, J. Bilmes (2013)
Curvature and Optimal Algorithms for Learning and Minimizing Submodular FunctionsArXiv, abs/1311.2110
S. Jegelka, J. Bilmes (2014)
Graph cuts with interacting edge weights: examples, approximations, and algorithmsMathematical Programming, 162
L. Lovász (1982)
Submodular functions and convexity
In this paper, we consider the non-negative submodular function minimization problem with covering type linear constraints. Assume that there exist m linear constraints, and we denote by $$\varDelta _i$$ Δ i the number of non-zero coefficients in the ith constraints. Furthermore, we assume that $$\varDelta _1 \ge \varDelta _2 \ge \cdots \ge \varDelta _m$$ Δ 1 ≥ Δ 2 ≥ ⋯ ≥ Δ m . For this problem, Koufogiannakis and Young proposed a polynomial-time $$\varDelta _1$$ Δ 1 -approximation algorithm. In this paper, we propose a new polynomial-time primal-dual approximation algorithm based on the approximation algorithm of Takazawa and Mizuno for the covering integer program with $$\{0,1\}$$ { 0 , 1 } -variables and the approximation algorithm of Iwata and Nagano for the submodular function minimization problem with set covering constraints. The approximation ratio of our algorithm is $$\max \{\varDelta _2, \min \{\varDelta _1, 1 + \varPi \}\}$$ max { Δ 2 , min { Δ 1 , 1 + Π } } , where $$\varPi $$ Π is the maximum size of a connected component of the input submodular function.
Algorithmica – Springer Journals
Published: Aug 14, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.