An approximation algorithm for minimum cost connected Roman dominating set problems (Q7444396)

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 8279619
Language Label Description Also known as
default for all languages
No label defined
    English
    An approximation algorithm for minimum cost connected Roman dominating set problems
    scientific article; zbMATH DE number 8279619

      Statements

      An approximation algorithm for minimum cost connected Roman dominating set problems (English)
      0 references
      0 references
      0 references
      0 references
      2026
      0 references
      connected Roman dominating set
      0 references
      cost function
      0 references
      greedy algorithm
      0 references
      approximation algorithm
      0 references

      Identifiers