Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"packing number"”.

  1. Bin packing, number balancing, and rescaling linear programs

    … for a classical NP-complete problem, the bin packing problem. In this problem, the goal is to pack items of sizes $s_i\in [0,1]$ into as few bins as possible, where a set of items fits into a bin provided the sum of the item sizes is at most one. We give a polynomial-time rounding scheme for a …

    washington Repository record for Bin packing, number balancing, and rescaling linear programs (opens in a new tab)

  2. Broadcast independence and broadcast packing

    … no broadcasting vertex hears another vertex. A packing broadcast is a broadcast where no vertex hears more than one vertex. The broadcast independence number, respectively the broadcast packing number, is the maximum weight over all independent broadcasts, respectively packing broadcasts, on G. …

    uvic Repository record for Broadcast independence and broadcast packing (opens in a new tab)

  3. Variations on a Theme: Graph Homomorphisms

    … to the previously defined quantum chromatic number. We also define two other parameters, projective rank and projective packing number, which satisfy a reciprocal relationship similar to that of fractional chromatic number and independence number, and are closely related to quantum …

    waterloo Repository record for Variations on a Theme: Graph Homomorphisms (opens in a new tab)

  4. Packing and Covering Odd (u,v)-trails in a Graph

    In this thesis, we investigate the problem of packing and covering odd $(u,v)$-trails in a graph. A $(u,v)$-trail is a $(u,v)$-walk that is allowed to have repeated vertices but no repeated edges. We call a trail \emph{odd} if the number of edges in the trail is odd. Given a graph $G$ and two …

    waterloo Repository record for Packing and Covering Odd (u,v)-trails in a Graph (opens in a new tab)

  5. On the Location and Number of Expansion Centers of Multiple Multipole Expansion Method

    … and computational accuracy are decided by the number of sources, N, and matched points, M. A criterion based on the concept of packing number is adopted to provide a variable sampling density that determines the optimal size of the matrix to be inverted. Addition and translation theorems are …

    marquette Repository record for On the Location and Number of Expansion Centers of Multiple Multipole Expansion Method (opens in a new tab)

  6. Domination in Benzenoids

    … or adjacent to a vertex in $D$. The domination number $\gamma=\gamma(G)$ of a graph $G$ is the size of a minimum dominating set. We will find formulas and bounds for the domination number of various special benzenoids, namely, linear chains $L(h)$, triangulenes $T_k$, and parallelogram …

    vcu Repository record for Domination in Benzenoids (opens in a new tab)