scientific article; zbMATH DE number 3887436

MaRDI QIDQ3220092zbMATH OpenFDO

Authors Peter Bachmann

Publication date 1984

zbMATH Keywords

asymptotic error boundgreedy-type-algorithmindependence systemisotone functionrank quotientsubmodular functionworst- case-analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)

Recommendations

• Approximation algorithm and its performance for maximizing submodular function subject to matroid intersection
• A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Greedy guarantees for non-submodular function maximization under independent system constraint with applications
• scientific article; zbMATH DE number 5670654

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 Q3220092)