208 search results - page 22 / 42 » Improved upper bounds on the crossing number |
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
ALGORITHMICA
2008
13 years 7 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
DAM
2006
13 years 7 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...