# Discrete Applied Mathematics

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 217-224

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 69-91

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 133-139

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 141-154

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 9-17

^{X}be the family of subsets ofx. IfK⊂ 2

^{x}such that for anyK

_{1},K

_{2}εK,k

_{1}≠K

_{2}impliesK

_{1}≠K

_{2}thenKis called a Sperner system. LetM be anm×n matrix and letX denote the set of columns ofM. IfA ⊂X,b εX andM contains no two rows equal inA but different inb, then we say thatA impliesb and the closure ofA, denoted...

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 225-237

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 109-122

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 155-167

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 19-39

^{2}. In this paper we extend these results to higher dimensions. The main result gives necessary and sufficient...

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 181-190

_{G}(S) ofS inG is the smallest number of edges in a connected subgraph ofG that containsS. Such a subgraph is necessarily a tree called a Steiner tree forS. The Steiner intervalI...

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 191-215

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 59-68

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 239-261

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 169-180

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 93-108

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 41-57

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 123-131

^{2}log

^{3}n) max-flow computations. The key of the proof is an extension of Radzik's analysis of Newton's method for linear fractional combinatorial optimization problems.

Discrete Applied Mathematics > 1998 > 81 > 1-3 > 1-7

_{1}, ..., a

_{n}andt and are to determine if some subset of thea

_{i}sums tot. We investigate the boundary between easy and hard variations of this problem. In particular, we consider the cases where the sequencea

_{1}, ..., a

_{n}is an arithmetic progression, a chain or superincreasing and where thea...