An approximation algorithm for minimum cost connected Roman dominating set problems
From MaRDI portal
Cites work
- A characterization of Roman trees
- Algorithmic aspects of Roman domination in graphs
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Graph-Theoretic Concepts in Computer Science
- Models of domination in graphs
- Nearly tight approximation algorithm for (connected) Roman dominating set
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
- Roman domination in graphs.
- Varieties of Roman Domination
This page was built for publication: An approximation algorithm for minimum cost connected Roman dominating set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444396)