Rewarding maps: On greedy optimization of set functions

DOI10.1006/AAMA.1995.1022MaRDI QIDQ1914786zbMATH OpenOpenAlexFDO

Authors Andreas W. M. Dress, Werner F. Terhalle

Publication date 26 November 1996

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/aama.1995.1022

zbMATH Keywords

greedy algorithmmatroidal mapsoptimizationrewarding mapsset function

Mathematics Subject Classification ID

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

Recommendations

• A framework for the greedy algorithm
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Greedy Families for Linear Objective Functions
• scientific article; zbMATH DE number 3904604

Cited in

(12)

• Parsimonious phylogenetic trees in metric spaces and simulated annealing
• Pointed groups and construction of modules
• The permutation class group of a finite group
• Discrete convex analysis
• Gross substitutability: an algorithmic survey
• Well-layered maps and the maximum-degree k k-subdeterminant of a matrix of rational functions
• Well-layered maps---a class of greedily optimizable set functions
• Two algorithms for valuated \(\Delta\)-matroids
• Computing Walrasian equilibria: fast algorithms and structural properties
• On the construction of substitutes
• The Burnside ring of the infinite cyclic group and its relations to the necklace algebra, -rings, and the universal ring of Witt vectors
• Polynomial operations from Burnside rings to representation functors

This page was built for publication: Rewarding maps: On greedy optimization of set functions

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