Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (Q1044047)
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: Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs |
scientific article; zbMATH DE number 5645017
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs |
scientific article; zbMATH DE number 5645017 |
Statements
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (English)
0 references
10 December 2009
0 references
graph algorithm
0 references
0 references
0 references
