288 search results - page 32 / 58 » Linearly bounded infinite graphs |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
TOMACS
2002
13 years 7 months ago
2002
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
WADS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
VIS
2006
IEEE
14 years 8 months ago
2006
IEEE
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...