SOFSEM
14 years 2 months ago
2010 Springer SOFSEM
14 years 2 months ago
2010 Springer SOFSEM
14 years 13 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 ...
SOFSEM
14 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...
SOFSEM
14 years 2 months ago
2010 Springer |