140 search results - page 18 / 28 » soda 2010 |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...