On short paths interdiction problems: Total and node-wise limited interdiction (Q929289)
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 5288688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On short paths interdiction problems: Total and node-wise limited interdiction |
scientific article; zbMATH DE number 5288688 |
Statements
On short paths interdiction problems: Total and node-wise limited interdiction (English)
0 references
17 June 2008
0 references
Approximation algorithm
0 references
Dijkstra's algorithm
0 references
Most vital arcs problem
0 references
Cyclic game
0 references
Maxmin mean cycle
0 references
Minimal vertex cover
0 references
Network inhibition
0 references
Network interdiction
0 references
0 references
0.8228139281272888
0 references
0.7908803224563599
0 references
0.7725958824157715
0 references
0.7653335332870483
0 references
0.7601765394210815
0 references
