Home  | Legals | Data Protection | Sitemap | KIT

Parallel Bi-Objective Shortest Paths using Weight-Balanced B-Trees with Bulk Updates

Parallel Bi-Objective Shortest Paths using Weight-Balanced B-Trees with Bulk Updates
Conference:

Symposium on Experimental Algorithms (SEA 2014)

Location:

Copenhagen

Date:

29/06-01/07/2014

Author(s):

S. Erb, M. Kobitzsch, P.Sanders

Speaker:

M. Kobitzsch