Partition matroid

In mathematics, a partition matroid or partitional matroid is a matroid formed from a direct sum of uniform matroids.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

In this paper we formulate a general link packing problem for mmWave networks. Each link is a 4-tuple determined by the choice of…

2014

The $$k$$-partitioning problem with partition matroid constraint is to partition the union of $$k$$ given sets of size $$m$$ into…

2014

We consider the problem of maximizing a given utility over heterogeneous wireless networks (HetNets) that have a practical (non…

2012

We propose constant-time algorithms for approximating the weight of the maximum weight branching in the general graph model. A…

2012

In this paper rough sets are studied from the viewpoint of partition matroids. A partition matroid is expressed as the direct sum…

2012

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type…

2009

This paper presents a new approximation algorithm for maximizing submodular set function under partition matroid constraint.The…

2007

1984

Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q…

1979

Given a matroid, where each element has a realvalued cost and is colored red or green; we seek a minimum cost base with exactly q…