Fast approximation algorithms for routing problems with hop-wise constraints (Q490222)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast approximation algorithms for routing problems with hop-wise constraints |
scientific article; zbMATH DE number 6389173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation algorithms for routing problems with hop-wise constraints |
scientific article; zbMATH DE number 6389173 |
Statements
Fast approximation algorithms for routing problems with hop-wise constraints (English)
0 references
22 January 2015
0 references
approximation algorithms
0 references
combinatorial problems
0 references
shortest path
0 references
routing
0 references
0 references
0 references
0.7751663327217102
0 references
0.7627314925193787
0 references
0.758928656578064
0 references
0.7537113428115845
0 references
0.7498977780342102
0 references
