Minimizing Symmetric Set Functions Faster

Simple item page
dc.creatorBrinkmeier, Michael
dc.date2006-03-28
dc.date.accessioned2026-07-07T07:05:55Z
dc.date.available2026-07-07T07:05:55Z
dc.descriptionWe describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi, constructs a non trivial set S minimizing d(S,V-S). This includes the possibility for the minimization of symmetric submodular functions. The presented algorithm requires at most as much time as the one described by Rizzi, but depending on the function d, it may allow several improvements.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/cs/0603108
dc.identifierhttp://arxiv.org/abs/cs/0603108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109842
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.subjectG.2.1; G.1.6; F.2.2
dc.titleMinimizing Symmetric Set Functions Faster
dc.typetext

Files

Collections

arXiv