Minimizing Symmetric Set Functions Faster

Details Minimizing Symmetric Set Functions Faster Minimizing Symmetric Set Functions Faster

2006-03-28

arxiv.org/abs/cs/0603108v1

Computer Science

Discrete Mathematics

9 pages

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

Minimizing Symmetric Set Functions Faster does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimizing Symmetric Set Functions Faster, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing Symmetric Set Functions Faster will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463387