Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,758 papers from all fields of science
Search
Sign In
Create Free Account
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)
Create Alert
Alert
Related topics
Related topics
7 relations
Dual matroid
Matroid
Matroid intersection
Matroid minor
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Link packing in mmWave networks
Yasaman Ghasempour
,
N. Prasad
,
M. Khojastepour
,
S. Rangarajan
IEEE International Conference on Communications…
2017
Corpus ID: 35919410
In this paper we formulate a general link packing problem for mmWave networks. Each link is a 4-tuple determined by the choice of…
Expand
2014
2014
Exploiting cell dormancy and load balancing in LTE HetNets: Optimizing the proportional fairness utility
N. Prasad
,
Mustafa Y. Arslan
,
S. Rangarajan
IEEE International Conference on Communications…
2014
Corpus ID: 22924642
We consider the problem of maximizing the proportional fairness (PF) utility over heterogeneous wireless networks (HetNets) by…
Expand
2014
2014
A two time scale approach for coordinated multi-point transmission and reception over practical backhaul
N. Prasad
,
Mustafa Y. Arslan
,
S. Rangarajan
International Conference on Communication Systems…
2014
Corpus ID: 2777577
We consider the problem of maximizing a given utility over heterogeneous wireless networks (HetNets) that have a practical (non…
Expand
2014
2014
Approximation algorithms for $$k$$-partitioning problems with partition matroid constraint
Weidong Li
,
Jianping Li
Optimization Letters
2014
Corpus ID: 3385030
The $$k$$-partitioning problem with partition matroid constraint is to partition the union of $$k$$ given sets of size $$m$$ into…
Expand
2014
2014
Secondary basis unique augmentation matroids and union minimal matroids
Hua Yao
,
William Zhu
,
Fei-Yue Wang
International Journal of Machine Learning and…
2014
Corpus ID: 31527186
By the augmentation axiom of matroids, given two independent sets whose cardinalities are not equal, there exists some other…
Expand
2012
2012
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs
M. Kusumoto
,
Yuichi Yoshida
,
Hiro Ito
Third International Conference on Networking and…
2012
Corpus ID: 7143508
We propose constant-time algorithms for approximating the weight of the maximum weight branching in the general graph model. A…
Expand
2009
2009
A Greedy Algorithm for Maximizing Submodular Set Function under Partition Matroid Constraint
He Shanglu
2009
Corpus ID: 123258461
This paper presents a new approximation algorithm for maximizing submodular set function under partition matroid constraint.The…
Expand
2008
2008
Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint
Biao Wu
,
E. Yao
2008
Corpus ID: 16565038
In this paper, the k-partitioning problem with partition matroid constraint is considered. LPT algorithm is modified to fit the…
Expand
1984
1984
Data structures for on-line updating of matroid intersection solutions
G. Frederickson
,
M. Srinivas
Symposium on the Theory of Computing
1984
Corpus ID: 2487255
Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q…
Expand
1979
1979
Efficient algorithms for simple matroid intersection problems
H. Gabow
,
R. Tarjan
20th Annual Symposium on Foundations of Computer…
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE