246 search results - page 48 / 50 » A Constant Factor Approximation Algorithm for Fault-Tolerant... |
SODA
2007
ACM
13 years 7 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
ICDE
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...