Improved approximation algorithms for minimum power covering problems (Q5919677): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2019.07.010 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127534638 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2019.07.010 / rank | |||
Normal rank | |||
Latest revision as of 01:04, 18 December 2024
scientific article; zbMATH DE number 7119846
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for minimum power covering problems |
scientific article; zbMATH DE number 7119846 |
Statements
Improved approximation algorithms for minimum power covering problems (English)
0 references
18 October 2019
0 references
Algorithms of about 5 lines length are presented as semi-verbal while-programs. The claim that they improve solutions known so far is proved with computations showing by rough counting 140 summations symbols.
0 references
graph theory
0 references
complexity of algorithms
0 references
0 references
0 references
