APPROX
2015
Springer
8 years 7 months ago
2015
Springer
APPROX
2015
Springer
8 years 7 months ago
2015
Springer
We prove that for any constant k and any < 1, there exist bimatrix win-lose games for which every -WSNE requires supports of cardinality greater than k. To do this, we provide ...
APPROX
2015
Springer
8 years 7 months ago
2015
Springer
In the Upper Degree-Constrained Partial Orientation (UDPO) problem we are given an undirected graph G = (V, E), together with two degree constraint functions d− , d+ : V → N. ...
APPROX
2015
Springer
8 years 7 months ago
2015
Springer
Imagine a wooden plate with a set of non-overlapping geometric objects painted on it. How many of them can a carpenter cut out using a panel saw making guillotine cuts, i.e., only...
APPROX
2015
Springer
8 years 7 months ago
2015
Springer
From the publish-subscribe systems of the early days of the Internet to the recent emergence of Web 3.0 and IoT (Internet of Things), new problems arise in the design of networks ...
APPROX
2015
Springer
8 years 7 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...
APPROX
2015
Springer
8 years 7 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 ...
APPROX
2015
Springer
8 years 7 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 ...
APPROX
2015
Springer
8 years 7 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 ...
APPROX
2015
Springer
8 years 7 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 ...