Back to Results
First PageMeta Content
Dynamic programming / Routing algorithms / Eulerian path / Shortest path problem / FloydWarshall algorithm / NP-complete problems / Planar separator theorem / Dominating set


Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2
Add to Reading List

Document Date: 2015-08-10 10:23:26


Open Document

File Size: 548,11 KB

Share Result on Facebook