84 search results - page 14 / 17 » icalp 2010 |
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...