Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,537,346 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.
2020
2020
Linear-Time Algorithms for Adaptive Submodular Maximization
Shaojie Tang
arXiv.org
2020
Corpus ID: 220403567
In this paper, we develop fast algorithms for two stochastic submodular maximization problems. We start with the well-studied…
Expand
2018
2018
Online Submodular Maximization: Beating 1/2 Made Simple
Niv Buchbinder
,
Moran Feldman
,
Mohit Garg
arXiv.org
2018
Corpus ID: 265095048
The Submodular Welfare Maximization problem (SWM) captures an important subclass of combinatorial auctions and has been studied…
Expand
2018
2018
Toward Optimal Coupon Allocation in Social Networks: An Approximate Submodular Optimization Approach
Shaojie Tang
arXiv.org
2018
Corpus ID: 3454547
CMO Council reports that 71\% of internet users in the U.S. were influenced by coupons and discounts when making their purchase…
Expand
2018
2018
Submodular Maximization : Beating 1 / 2 Made Simple Niv
Buchbinder
,
Moran Feldman
,
Yuval Filmus
,
Mohit Garg
2018
Corpus ID: 73554793
The Submodular Welfare Maximization problem (SWM) captures an important subclass of combinatorial auctions and has been studied…
Expand
2012
2012
Covering matroid
Yanfang Liu
,
William Zhu
2012
Corpus ID: 14099962
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type…
Expand
2012
2012
The Greedy Algorithm and Its Performance Guarantees for Maximizing Nonne-ativeand Non-decreasing Submodular Function Subject to a Partition Matroid Constraint
Wang Wu-min
2012
Corpus ID: 124011161
Maximizing or minimizing submodular function has widely used in combinatorial optimization problem,in this paper,we present an…
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
1988
1988
Combinatorial Improvements of the 1-Tree Bound for the Traveling Salesman Problem
F. Rendl
1988
Corpus ID: 124988812
1-trees are used as relaxation for the symmetric Traveling Salesman Problem. We propose to strengthen this relaxation by adding…
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