Categorized bottleneck-minisum path problems on networks (Q1890954)
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 758391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Categorized bottleneck-minisum path problems on networks |
scientific article; zbMATH DE number 758391 |
Statements
Categorized bottleneck-minisum path problems on networks (English)
0 references
28 May 1995
0 references
shortest path
0 references
bottleneck
0 references
NP-complete
0 references
0.7882922291755676
0 references
0.7829324007034302
0 references
0.7607953548431396
0 references
0.7571686506271362
0 references
