109 search results - page 19 / 22 » An Approximation Algorithm for Shortest Descending Paths |
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
81
Voted
ESA
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
69
Voted
ICCAD
1996
IEEE
15 years 1 months ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
64
Voted
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...