Sciweavers

SOFSEM
2010
Springer
14 years 13 days ago
On a Labeled Vehicle Routing Problem
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 ...
Hatem Chatti, Laurent Gourvès, Jér&o...
SOFSEM
2010
Springer
14 years 2 months ago
Regret Minimization and Job Scheduling
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...
Yishay Mansour
SOFSEM
2010
Springer
14 years 2 months ago
Dynamic Edit Distance Table under a General Weighted Cost Function
Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Ine...
Theoretical Computer Science
Top of PageReset Settings