192 search results - page 23 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
168
click to vote
STOC
1999
ACM
15 years 6 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
105
Voted
COCOON
2010
Springer
15 years 6 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
127
Voted
ESA
2008
Springer
15 years 3 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
130
Voted
MOC
2002
15 years 1 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
115
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...