183
click to vote
FOCS
15 years 10 months ago
2006 IEEE 
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
127
click to vote
FOCS
15 years 10 months ago
2006 IEEE 
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
154
click to vote
FOCS
15 years 10 months ago
2006 IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
131
click to vote
FOCS
15 years 10 months ago
2006 IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
155
click to vote
FOCS
15 years 10 months ago
2006 IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
|
Theoretical Computer Science