Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845)
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 4024783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems |
scientific article; zbMATH DE number 4024783 |
Statements
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (English)
0 references
1984
0 references
polynomial time algorithms
0 references
NP-complete problems
0 references
parallel algorithms
0 references
NP-hard graph problems
0 references
facility location problem
0 references
parallel implementation
0 references
0.8138399124145508
0 references
0.8101295828819275
0 references
0.8072729706764221
0 references
0.8053785562515259
0 references
