Skip to search formSkip to main contentSkip to account menu

Partition matroid

In mathematics, a partition matroid or partitional matroid is a matroid formed from a direct sum of uniform matroids.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
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
2014
We consider the problem of maximizing the proportional fairness (PF) utility over heterogeneous wireless networks (HetNets) by… 
2014
2014
We consider the problem of maximizing a given utility over heterogeneous wireless networks (HetNets) that have a practical (non… 
2014
2014
The $$k$$-partitioning problem with partition matroid constraint is to partition the union of $$k$$ given sets of size $$m$$ into… 
2014
2014
By the augmentation axiom of matroids, given two independent sets whose cardinalities are not equal, there exists some other… 
2012
2012
We propose constant-time algorithms for approximating the weight of the maximum weight branching in the general graph model. A… 
2009
2009
This paper presents a new approximation algorithm for maximizing submodular set function under partition matroid constraint.The… 
2008
2008
In this paper, the k-partitioning problem with partition matroid constraint is considered. LPT algorithm is modified to fit the… 
1984
1984
Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q… 
1979
1979
  • H. GabowR. Tarjan
  • 1979
  • Corpus ID: 15023936
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…