Results 101 to 110 of about 511 (171)
Matroid polytope subdivisions and valuations [PDF]
, 2010 Many important invariants for matroids and polymatroids are valuations (or are valuative), which is to say they satisfy certain relations imposed by subdivisions of matroid polytopes.
Fink, Alexander Ray
core
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
, 1986 The quasi-greedy algorithm, as proposed by Glover and Klingman [8], efficiently solves minimum weight spanning tree problems with a fixed (or bounded) number of edges incident to a specified vertex.
Glover, Fred, Novick, Beth
core +1 more source
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes. [PDF]
J Math Biol, 2021 Gross E +5 more
europepmc +1 more source
Matroidizing set systems: a new approach to matroid theory
, 1990 For a finite nonempty set E we associate in a canonical way to every antichain B⊆P(E) a matroid M(B) such that M(B)=M0 if B is the set of bases of a matroid M0.
Wenzel, Walter +3 more
core +1 more source
A simple approach to some basic results in matroid theory
, 1981 The bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads to simple proofs of some basic and well-known facts about matroids, including a variety of ...
Dawson, Jereḿy E
core +1 more source
Generalized Index Coding Problem and Discrete Polymatroids. [PDF]
Entropy (Basel), 2020 Thomas A, Sundar Rajan B.
europepmc +1 more source
Improved Algorithms for White-Box Adversarial Streams. [PDF]
Proc Mach Learn Res, 2023 Feng Y, Woodruff DP.
europepmc +1 more source
, 2002 We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a
Onn, Shmuel
core
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. [PDF]
Math Program, 2022 Bruggmann S, Zenklusen R.
europepmc +1 more source
Geometric lower bounds for parametric matroid optimization [PDF]
, 1995 We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and convex polygons in line arrangements.
Eppstein, David
core