1647 search results - page 123 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
176
click to vote
PROPERTYTESTING
2010
15 years 2 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
146
Voted
ASIAMS
2007
IEEE
15 years 11 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
121
click to vote
ISMIS
2005
Springer
15 years 10 months ago
2005
Springer
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
155
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
170
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...