Two remarks concerning balanced matroids

Details Two remarks concerning balanced matroids Two remarks concerning balanced matroids

2004-04-09

arxiv.org/abs/math/0404200v1

Mathematics

Combinatorics

Scientific paper

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich enough combinatorially to permit the encoding of hard counting problems; and (b) a paving matroid that is not balanced. The computational significance of (a) is the following. As a consequence of balance, there is an efficient algorithm for approximating the number of bases of a sparse paving matroid within specified relative error. On the other hand, determining the number of bases exactly is likely to be computationally intractable.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548914