A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373)
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: A strongly polynomial algorithm for the inverse shortest arborescence problem |
scientific article; zbMATH DE number 1139437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial algorithm for the inverse shortest arborescence problem |
scientific article; zbMATH DE number 1139437 |
Statements
A strongly polynomial algorithm for the inverse shortest arborescence problem (English)
0 references
5 October 1998
0 references
inverse problem
0 references
weighted shortest arborescence problem
0 references
0.8764511346817017
0 references
0.8348320722579956
0 references
0.8161430954933167
0 references
0.8121141195297241
0 references
0.8086662292480469
0 references
