On greedy algorithms, partially ordered sets, and submodular functions

Autor:	Alan J. Hoffman, Brenda Dietrich
Rok vydání:	2003
Předmět:	Combinatorics Discrete mathematics General Computer Science Maximum coverage problem Partially ordered set Greedy algorithm Greedy randomized adaptive search procedure Mathematics Submodular set function
Zdroj:	IBM Journal of Research and Development. 47:25-30
ISSN:	0018-8646
DOI:	10.1147/rd.471.0025
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::8f9dbd34f0f2d1b826e631e553bc8e1d https://doi.org/10.1147/rd.471.0025 Zobrazit plný text záznamu