105
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust comb...
110
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
The all-terminal reliability polynomial of a graph counts its connected subgraphs of various sizes. Algorithms based on sequential importance sampling (SIS) have been proposed to ...
113
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
In the Node-Disjoint Paths (NDP) problem, the input is an undirected n-vertex graph G, and a collection {(s1, t1), . . . , (sk, tk)} of pairs of vertices called demand pairs. The ...
117
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
Given a stream of data, a typical approach in streaming algorithms is to design a sophisticated algorithm with small memory that computes a specific statistic over the streaming ...
111
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
Despite the large amount of work on solving graph problems in the data stream model, there do not exist tight space bounds for almost any of them, even in a stream with only edge ...