63 search results - page 2 / 13 » On a Geometric Generalization of the Upper Bound Theorem |
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
COMPGEOM
1993
ACM
13 years 9 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...