62 search results - page 12 / 13 » Closed k-stop distance in graphs |
AFRIGRAPH
2003
ACM
15 years 3 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
88
Voted
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
108
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
111
Voted
WIOPT
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
106
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...