Accelerated greedy algorithms for maximizing submodular set functions

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Other literature type 05 Oct 2005 English Publisher:Springer Science and Business Media LLC

Authors: Michel Minoux;

doi: 10.1007/bfb0006528

Accelerated greedy algorithms for maximizing submodular set functions

- Summary
- Metrics

Abstract

Given a finite set E and a real valued function f on P(E) (the power set of E) the optimal subset problem (P) is to find S ⊂ E maximizing f over P(E). Many combinatorial optimization problems can be formulated in these terms. Here, a family of approximate solution methods is studied : the greedy algorithms.

Related Organizations

École Normale Supérieure
France
École Nationale Supérieure de Techniques Avancées
France

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	185
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

185

Top 1%

Average

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now