Results 11 to 20 of about 737 (80)
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 10, Page 581-588, 2001., 2001 Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set.
Matveev, Andrey O.
core +2 more sources
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
Packing a bin online to maximize the total number of items [PDF]
, 1996 A bin of capacity 1 and a nite sequence of items of\ud sizes a1; a2; : : : are considered, where the items are given one by one\ud without information about the future.
Faigle, Ulrich, Kern, Walter
core +3 more sources
Approximate modularity: Kalton's constant is not smaller than 3 [PDF]
, 2020 Kalton and Roberts [Trans. Amer. Math. Soc., 278 (1983), 803--816] proved that there exists a universal constant $K\leqslant 44.5$ such that for every set algebra $\mathcal{F}$ and every 1-additive function $f\colon \mathcal{F}\to \mathbb R$ there exists
Gnacik, Michal +2 more
core +2 more sources
A linear time algorithm for a variant of the max cut problem in series parallel graphs [PDF]
, 2017 Given a graph $G=(V, E)$, a connected sides cut $(U, V\backslash U)$ or $\delta (U)$ is the set of edges of E linking all vertices of U to all vertices of $V\backslash U$ such that the induced subgraphs $G[U]$ and $G[V\backslash U]$ are connected.
Chaourar, Brahim
core +3 more sources
On some interconnections between combinatorial optimization and extremal graph theory [PDF]
, 2004 The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set.
Cvetković Dragoš M. +2 more
core +1 more source
Extended blocker, deletion, and contraction maps on antichains
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 10, Page 607-616, 2003., 2003 Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered. Influence of the parameters of the maps is investigated. Order‐theoretic extensions of some principal relations for the set‐theoretic blocker, deletion, and contraction maps on clutters are ...
Andrey O. Matveev
wiley +1 more source
A note on operators of deletion and contraction for antichains
International Journal of Mathematics and Mathematical Sciences, Volume 31, Issue 12, Page 725-729, 2002., 2002 The operators of deletion and contraction for clutters are generalized to those for antichains of finite bounded posets. A generalization of the result by Seymour (1976), describing the relationship between the operators of deletion, contraction, and the blocker map, is considered as a comparison in the lattice of antichains of a poset.
Andrey O. Matveev
wiley +1 more source
A greedy algorithm for interval greedoids
Open Mathematics, 2018 We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.
Mao Hua
doaj +1 more source
Improved integral simplex using decomposition for the set partitioning problem
EURO Journal on Computational Optimization, 2018 Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at each ...
Abdelouahab Zaghrouti +2 more
doaj +1 more source