833 search results - page 1 / 167 » Simpler and better approximation algorithms for network desi... |
85
Voted
JACM
2007
15 years 10 days ago
2007
91
Voted
STOC
2003
ACM
16 years 23 days ago
2003
ACM
82
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
85
Voted
ORL
2007
14 years 12 months ago
2007
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
112
Voted
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...