A note on submodular function minimization with covering type linear constraints
type: Item
instance of: scholarly article
title: A note on submodular function minimization with covering type linear constraints
zbMATH Open document ID: 1402.90150
author: Naoyuki Kamiyama
published in: Algorithmica
publication date: 2018-07-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6911195
zbMATH Keywords: submodular function minimization
zbMATH Keywords: primal-dual approximation algorithm
MaRDI profile type: Publication
full work available at URL: s00453-017-0363-8
OpenAlex ID: W2748419052
cites work: Learning with Submodular Functions: A Convex Optimization Perspective
cites work: Primal-dual schema for capacitated covering problems
cites work: Q4952606
cites work: Minimizing symmetric submodular functions
cites work: Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Geometric algorithms and combinatorial optimization
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Submodular Function Minimization under Covering Constraints
cites work: Graph cuts with interacting edge weights: examples, approximations, and algorithms
cites work: Submodular Function Minimization under a Submodular Set Covering Constraint
cites work: Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
cites work: Discrete Convex Analysis
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Submodular Approximation: Sampling-based Algorithms and Lower Bounds
cites work: A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
DOI: 10.1007/S00453-017-0363-8
description: scientific article; zbMATH DE number 6911195