Sciweavers

32
Voted
TALG
2016
40views more  TALG 2016»
9 years 11 months ago
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
Ofer Neiman, Shay Solomon
36
Voted
TALG
2016
52views more  TALG 2016»
9 years 11 months ago
A New Approach to Incremental Cycle Detection and Related Problems
We consider the problem of detecting a cycle in a directed graph that grows by arc insertions, and the related problems of maintaining a topological order and the strong components...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
TALG
2016
39views more  TALG 2016»
9 years 11 months ago
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estima...
Lukás Polácek, Ola Svensson
53
Voted
TALG
2016
64views more  TALG 2016»
9 years 11 months ago
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some k, the problem is roughly 2...
Michael Dinitz, Guy Kortsarz, Ran Raz
28
Voted
TALG
2016
54views more  TALG 2016»
9 years 11 months ago
Width of Points in the Streaming Model
Alexandr Andoni, Huy L. Nguyên
30
Voted
TALG
2016
43views more  TALG 2016»
9 years 11 months ago
Anarchy Is Free in Network Creation
Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po...