Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPROX
2015
Springer
24views Algorithms» more  APPROX 2015»
5 years 7 months ago
Large Supports are Required for Well-Supported Nash Equilibria
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 ...
Yogesh Anbalagan, Hao Huang, Shachar Lovett, Serge...
APPROX
2015
Springer
30views Algorithms» more  APPROX 2015»
5 years 7 months ago
Approximating Upper Degree-Constrained Partial Orientations
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. ...
Marek Cygan, Tomasz Kociumaka
APPROX
2015
Springer
13views Algorithms» more  APPROX 2015»
5 years 7 months ago
On Guillotine Cutting Sequences
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...
Fidaa Abed, Parinya Chalermsook, José R. Co...
APPROX
2015
Springer
21views Algorithms» more  APPROX 2015»
5 years 7 months ago
Designing Overlapping Networks for Publish-Subscribe Systems
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
28views Algorithms» more  APPROX 2015»
5 years 7 months ago
Non-Uniform Robust Network Design in Planar Graphs
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...
David Adjiashvili
APPROX
2015
Springer
20views Algorithms» more  APPROX 2015»
5 years 7 months ago
Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs
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 ...
David G. Harris, Francis Sullivan
APPROX
2015
Springer
22views Algorithms» more  APPROX 2015»
5 years 7 months ago
On Approximating Node-Disjoint Paths in Grids
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 ...
Julia Chuzhoy, David H. K. Kim
APPROX
2015
Springer
22views Algorithms» more  APPROX 2015»
5 years 7 months ago
Zero-One Laws for Sliding Windows and Universal Sketches
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 ...
Vladimir Braverman, Rafail Ostrovsky, Alan Roytman
APPROX
2015
Springer
17views Algorithms» more  APPROX 2015»
5 years 7 months ago
Tight Bounds for Graph Problems in Insertion Streams
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 ...
Xiaoming Sun, David P. Woodruff
books