Improved approximation algorithms for minimum power covering problems (Q5919677)

From MaRDI portal
Revision as of 01:04, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers