2095 search results - page 364 / 419 » Improved pebbling bounds |
COMCOM
2004
13 years 9 months ago
2004
This article proposes the XGOP-B deterministic traffic model for MPEG video services requiring strict bounds on the quality of service provided by the network. The XGOP-B model ta...
CPC
2004
13 years 9 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
IPL
2002
13 years 9 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
IPL
1998
13 years 9 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
JCT
1998
13 years 9 months ago
1998
For k > 2 and r ≥ 2, let G(k, r) denote the smallest positive integer g such that every increasing sequence of g integers {a1, a2, . . . , ag} with gaps aj+1 − aj ∈ {1, ....