Efficient heuristics for determining node-disjoint path pairs visiting specified nodes (Q6496358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7841995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient heuristics for determining node-disjoint path pairs visiting specified nodes |
scientific article; zbMATH DE number 7841995 |
Statements
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes (English)
0 references
3 May 2024
0 references
resilient routing
0 references
visiting a given set of nodes
0 references
min-sum
0 references
heuristics
0 references
node-disjoint path pair
0 references
path-based formulation
0 references
0 references
0 references
0.6997076869010925
0 references
0.6752246022224426
0 references
0.6676782965660095
0 references
0.664057731628418
0 references
0.6606985330581665
0 references
