Convex Matroid Optimization

Details Convex Matroid Optimization Convex Matroid Optimization

2002-07-16

arxiv.org/abs/math/0207136v1

SIAM Journal on Discrete Mathematics, 17:249--253, 2003

Mathematics

Combinatorics

Scientific paper

We consider a problem of optimizing convex functionals over matroid bases. It
is richly expressive and captures certain quadratic assignment and clustering
problems. While generally NP-hard, we show it is polynomial time solvable when
a suitable parameter is restricted.

Affiliated with

Also associated with

No associations

Rating

Convex Matroid Optimization 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 Convex Matroid Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Matroid Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561680