249 search results - page 34 / 50 » The upper bound on k-tuple domination numbers of graphs |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
COMBINATORICA
2008
13 years 8 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
SIAMDM
2008
13 years 8 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— Atmospheric turbulence induced fading is one of the main impairments affecting free–space optics (FSO). In recent years, Gamma–Gamma fading has become the dominant fading m...