Results 181 to 190 of about 22,632 (241)
Some of the next articles are maybe not open access.
Generate $��$-matroids from matroids
2021We give necessary and sufficient conditions for two matroids on the same ground set to be the upper and lower matroid of a $ $-matroid.
Avohou, R��mi Cocou +2 more
openaire +1 more source
Categorical relations among matroids, fuzzy matroids and fuzzifying matroids
2010Summary: The aim of this paper is to study the categorical relations between matroids. Goetschel-Voxman's fuzzy matroids and Sin's fuzzifying matroids. It is shown that the category of fuzzifying matroids is isomorphic to that of closed fuzzy matroids and the latter is concretely coreflective in the category of fuzzy matroids.
Lu, Ling-Xia, Zheng, Wei-Wei
openaire +2 more sources
Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
Adaptive Agents and Multi-Agent Systems, 2019In this paper, we consider a matroid generalization of the hospitals/residents problem with ties. Especially, we focus on the situation in which we are given a master list and the preference list of each hospital over residents is derived from this ...
Naoyuki Kamiyama
semanticscholar +1 more source
Archiv der Mathematik, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Shyh-Nan, Shih, Mau-Hsiang
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Shyh-Nan, Shih, Mau-Hsiang
openaire +2 more sources
Journal of the ACM, 2018
We define a generalization of the classical secretary problem called the matroid secretary problem. In this problem, the elements of a matroid are presented to an online algorithm in uniformly random order. When an element arrives, the algorithm observes
Moshe Babaioff +3 more
semanticscholar +1 more source
We define a generalization of the classical secretary problem called the matroid secretary problem. In this problem, the elements of a matroid are presented to an online algorithm in uniformly random order. When an element arrives, the algorithm observes
Moshe Babaioff +3 more
semanticscholar +1 more source
Combinatorics, Probability and Computing, 2008
Semple and Welsh [5] introduced the concept of correlated matroids, which relate to conjectures by Grimmett and Winkler [2], and Pemantle [4], respectively, that the uniformly random forest and the uniformly random connected subgraph of a finite graph have the edge-negative-association property. In this paper, we extend results of Semple and Welsh, and
openaire +2 more sources
Semple and Welsh [5] introduced the concept of correlated matroids, which relate to conjectures by Grimmett and Winkler [2], and Pemantle [4], respectively, that the uniformly random forest and the uniformly random connected subgraph of a finite graph have the edge-negative-association property. In this paper, we extend results of Semple and Welsh, and
openaire +2 more sources
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid
ACM-SIAM Symposium on Discrete Algorithms, 2018We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + e)-approximation for the problem.
Niv Buchbinder +2 more
semanticscholar +1 more source
Annals of Combinatorics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2003
The main idea in this chapter is to establish the intimate connection between matroids and the symmetric group Sym n . This will be seen most clearly in the Maximality Property, which is really just a reformulation of the well-known characterization of matroids in terms of the Greedy Algorithm.
Alexandre V. Borovik +2 more
openaire +1 more source
The main idea in this chapter is to establish the intimate connection between matroids and the symmetric group Sym n . This will be seen most clearly in the Maximality Property, which is really just a reformulation of the well-known characterization of matroids in terms of the Greedy Algorithm.
Alexandre V. Borovik +2 more
openaire +1 more source
Discrete Mathematics and Applications, 2005
The object of study is an ordered set with some closure operator and a family of sets where some form of the axiom of closure is fulfilled.
openaire +2 more sources
The object of study is an ordered set with some closure operator and a family of sets where some form of the axiom of closure is fulfilled.
openaire +2 more sources