An approximation algorithm and its performance guarantee for minimizing non-decreasing supermodular set function
From MaRDI portal
Publication:2859721
zbMATH Open1289.90163MaRDI QIDQ2859721
Yuelin Gao, Zijun Hao, Shanglu He
Publication date: 19 November 2013
Published in: Mathematics in Practice and Theory (Search for Journal in Brave)
approximation algorithmsupermodular set functioncombinatorial optimization problemperformance guarantee
Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region ⋮ Two approximation algorithms for maximizing nonnegative weakly monotonic set functions ⋮ Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
This page was built for publication: An approximation algorithm and its performance guarantee for minimizing non-decreasing supermodular set function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859721)
