scientific article; zbMATH DE number 5670654

MaRDI QIDQ3403832zbMATH OpenFDO

Authors Sheng Zhang, Shanglu He

Publication date 12 February 2010

zbMATH Keywords

combinatorial optimizationgreedy algorithmsubmodular set function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• New performance guarantees for the greedy maximization of submodular set functions
• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
• Maximizing submodular set functions subject to multiple linear constraints
• An approximation algorithm and its performance guarantee for maximizing non-increasing submodular set function
• An accelerated continuous greedy algorithm for maximizing strong submodular functions
• Improved approximation algorithms for \(k\)-submodular function maximization
• Constrained submodular maximization via greedy local search
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint
• Improved randomized algorithm for k-submodular function maximization

Cited in

(4)

• Constrained submodular maximization via greedy local search
• scientific article; zbMATH DE number 3887436 (Why is no real title available?)
• An approximation algorithm and its performance guarantee for maximizing non-increasing submodular set function
• Maximizing submodular set functions subject to multiple linear constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3403832)