126
click to vote
SOFSEM
15 years 10 months ago
2010 Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
136
click to vote
SOFSEM
16 years 22 hour ago
2010 Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
96
Voted
SOFSEM
16 years 22 hour ago
2010 Springer |