Easy and hard bottleneck location problems (Q1135201)
From MaRDI portal
!
WARNING
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 3661099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Easy and hard bottleneck location problems |
scientific article; zbMATH DE number 3661099 |
Statements
Easy and hard bottleneck location problems (English)
0 references
1979
0 references
bottleneck location problem on a graph
0 references
blocking clutters
0 references
duality
0 references
disconnecting sets on a graph
0 references
binary search
0 references
dynamic programming
0 references
polynomial time algorithm
0 references
NP-hard problem
0 references
NP-complete problem
0 references
