Complexity and inapproximability results for the power edge set problem (Q1743493)
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 6859594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and inapproximability results for the power edge set problem |
scientific article; zbMATH DE number 6859594 |
Statements
Complexity and inapproximability results for the power edge set problem (English)
0 references
13 April 2018
0 references
PMU placement problem
0 references
power edge set
0 references
NP-hardness
0 references
inapproximability
0 references
0.96448183
0 references
0.9216129
0 references
0.89363855
0 references
0.8882072
0 references
0 references
0.8819151
0 references
0.8785787
0 references
0.87787384
0 references
0.8776193
0 references
