Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
type: Item
instance of: scholarly article
title: Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
zbMATH Open document ID: 1162.90545
author: Nick Linker
author: Victor Petrovich Il'ev
published in: European Journal of Operational Research
publication date: 2006-03-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5012930
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: heuristics
zbMATH Keywords: supermodular set function
zbMATH Keywords: comatroid
zbMATH Keywords: performance guarantee
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.09.026
OpenAlex ID: W1981719462
cites work: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: An analysis of approximations for maximizing submodular set functions—I
DOI: 10.1016/J.EJOR.2004.09.026
description: scientific article; zbMATH DE number 5012930