Minimum-weight vertex cover problem for two-class resource connection graphs (Q1310947)
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: Minimum-weight vertex cover problem for two-class resource connection graphs |
scientific article; zbMATH DE number 484083
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-weight vertex cover problem for two-class resource connection graphs |
scientific article; zbMATH DE number 484083 |
Statements
Minimum-weight vertex cover problem for two-class resource connection graphs (English)
0 references
20 March 1994
0 references
resource migration
0 references
locally distributed processing systems
0 references
broadcast network
0 references
optimization problem
0 references
\(\Sigma\) graphs
0 references
NP-hard
0 references
heuristic
0 references
