113
click to vote
APPROX
2015
Springer
9 years 11 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 ...
161
click to vote
APPROX
2015
Springer
9 years 11 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. ...
118
Voted
APPROX
2015
Springer
9 years 11 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...
113
click to vote
APPROX
2015
Springer
9 years 11 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 ...