140
Voted
SOFSEM
16 years 2 months ago
2010 Springer  168
click to vote
SOFSEM
16 years 19 days 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 ...
167
Voted
SOFSEM
16 years 2 months 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...
126
Voted
SOFSEM
16 years 2 months ago
2010 Springer |
Theoretical Computer Science