Results 1  10
of
1,059
Maximum Packings of Kn with Hexagons
 Australasian Journal of Combinatorics
, 1993
"... A complete solution of the maximum packing problem of Kn with hexagons is given. 1 ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
A complete solution of the maximum packing problem of Kn with hexagons is given. 1
Maximum Packing Technique Performance Evaluation
, 2001
"... This paper presents a new analytical model which evaluates the performance of the Maximum Packing channel allocation technique on a generic cellular system. The main innovations introduced in this model are the deterministic identification of the system spacestate S MP and its subsequent applicatio ..."
Abstract
 Add to MetaCart
This paper presents a new analytical model which evaluates the performance of the Maximum Packing channel allocation technique on a generic cellular system. The main innovations introduced in this model are the deterministic identification of the system spacestate S MP and its subsequent
Weakly Unionfree Maximum Packings
, 1998
"... . Frankl and Furedi established that the largest number of 3subsets of an nset for which no four distinct sets A;B;C;D satisfy A [ B = C [ D is at most b n(n\Gamma1) 3 c. Chee, Colbourn, and Ling established that this upper bound is met, with few exceptions, when n j 0; 1 (mod 3). In this pape ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Frankl and Furedi established that the largest number of 3subsets of an nset for which no four distinct sets A;B;C;D satisfy A [ B = C [ D is at most b n(n\Gamma1) 3 c. Chee, Colbourn, and Ling established that this upper bound is met, with few exceptions, when n j 0; 1 (mod 3). In this paper, it is established that the upper bound is also met with few exceptions when n j 2 (mod 3). Keywords: unionfree hypergraph, twofold triple system, group testing 1. Introduction A group divisible design (GDD) is a triple (X; G; B) which satisfies the following properties: (1) G is a partition of a set X (of points) into subsets called groups, (2) B is a set of subsets of X (called blocks) such that a group and a block contain at most one common point, (3) every pair of points from distinct groups occurs in exactly blocks. The parameter is the index of the GDD, and jXj is its order. The grouptype (type) of the GDD is the multiset [jGj : G 2 G]. We usually use an "exponential" notation ...
Two DoyenWilson theorems for maximum packings with triples
, 1998
"... In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary and sufficient conditions for a maximum packing with triples of order m MPT(m) to be embedded in an MPT(n). We also characterize when it is possible to embed an MPT(m) with leave LI in an MPT(n) with le ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary and sufficient conditions for a maximum packing with triples of order m MPT(m) to be embedded in an MPT(n). We also characterize when it is possible to embed an MPT(m) with leave LI in an MPT
An Approximation Algorithm for Maximum Packing of 3Edge Paths
 Information Processing Letters 63
, 1997
"... Introduction Let G = (V; E) be a complete graph with node set V and edge set E. For (u; v) 2 E let w(u; v) 0 be its weight. Assume that jV j = n = 4k for some integer k. A packing of 3edge paths is a set of k nodedisjoint paths of three edges (and thus four nodes) each. The subject of this note ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
is the problem of computing a packing of 3edge paths with maximum total edge weight. The problem is NPhard [5]. The problem is a special case of the general set packing problem considered in [1, 2] and the general results there imply a 1 3 bound on the performance ratio. In this note we prove that a simple
Almost Resolvable Maximum Packings of Complete Graphs with 4Cycles
, 2011
"... If the complete graph Kn has vertex set X, a maximum packing of Kn with 4cycles, (X, C, L), is an edgedisjoint decomposition of Kn into a collection C of 4cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4cycles were shown to exist by Schön ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
If the complete graph Kn has vertex set X, a maximum packing of Kn with 4cycles, (X, C, L), is an edgedisjoint decomposition of Kn into a collection C of 4cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4cycles were shown to exist
Maximum Packing Technique Performance in Highway and Planar Cellular Type Systems
, 2002
"... This paper presents an analytical model that evaluates the performance of the Maximum Packing channel allocation technique on linear and planar cellular systems. The main innovations introduced by this model are the deterministic identification of the system spacestate and its application to a mult ..."
Abstract
 Add to MetaCart
This paper presents an analytical model that evaluates the performance of the Maximum Packing channel allocation technique on linear and planar cellular systems. The main innovations introduced by this model are the deterministic identification of the system spacestate and its application to a
Embedding path designs into a maximum packing of Kn with 4cycles
"... A packing of Kn with copies of C4 (the cycle of length 4), is an ordered triple (V, C, L), where V is the vertex set of the complete graph Kn, C is a collection of edgedisjoint copies of C4, and L is the set of edges not belonging to a block of C. The number n is called the order of the packing and ..."
Abstract
 Add to MetaCart
and the set of unused edges L is called the leave. If C is as large as possible, then (V, C, L) is called a maximum packing MPC(n, 4, 1). We say that a path design P (v, k, 1) (W,P) is embedded into an MPC(n, 4, 1) (V, C, L) if there is an injective mapping f: P → C such that P is a subgraph of f (P
Grassmannian beamforming for multipleinput multipleoutput wireless systems
 IEEE TRANS. INFORM. THEORY
, 2003
"... Transmit beamforming and receive combining are simple methods for exploiting the significant diversity that is available in multipleinput and multipleoutput (MIMO) wireless systems. Unfortunately, optimal performance requires either complete channel knowledge or knowledge of the optimal beamformi ..."
Abstract

Cited by 329 (38 self)
 Add to MetaCart
beamforming vector which are not always realizable in practice. In this correspondence, a quantized maximum signaltonoise ratio (SNR) beamforming technique is proposed where the receiver only sends the label of the best beamforming vector in a predetermined codebook to the transmitter. By using
Results 1  10
of
1,059