Results 151 to 160 of about 4,266 (227)

Non-Preemptive Tree Packing. [PDF]

Algorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]

Res Math Sci
Fink A, Giansiracusa J, Giansiracusa N, Mundinger J.   +3 more
europepmc   +1 more source

Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid. [PDF]

Math Program
Santiago R, Sergeev I, Zenklusen R.
europepmc   +1 more source

Matroids, positroids and paths

Matroids arise from the abstract notion of dependency. Matroids can be studied from different points of view. From linear algebra we know matrices, which can be seen as matroids, however matroids generalise the concept of dependency.
Ros Jiménez, Zaira
core  

The cyclic flats of a q-matroid. [PDF]

J Algebr Comb (Dordr)
Alfarano GN, Byrne E.
europepmc   +1 more source

An efficient characterization of submodular spanning tree games. [PDF]

Math Program, 2020
Koh ZK, Sanità L.
europepmc   +1 more source

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. [PDF]

Math Program
Briański M, Koutecký M, Král' D, Pekárková K, Schröder F.   +4 more
europepmc   +1 more source

A partition-based optimization model and its performance benchmark for Generative Anatomy Modeling Language. [PDF]

Comput Biol Med, 2020
Demirel D, Cetinsaya B, Halic T, Kockara S, Reiners D, Ahmadi S, Arikatla S.   +6 more
europepmc   +1 more source

Diverse collections in matroids and graphs. [PDF]

Math Program
Fomin FV, Golovach PA, Panolan F, Philip G, Saurabh S.   +4 more
europepmc   +1 more source

Fuzzy closure matroids

, 2016
In 1988, Geotschel and Voxman [1] introduced and explored the concept of fuzzy matroids via the notion of fuzzy independent sets. In 2013, Al-Hawary [2] introduced fuzzy matroids via the notion of fuzzy flats.
Anis Amalina
core