Approximation algorithm for the minimum partial connected Roman dominating set problem
From MaRDI portal
Publication:6571270
Recommendations
- Nearly tight approximation algorithm for (connected) Roman dominating set
- Algorithmic aspects of Roman domination in graphs
- Hardness results of global Roman domination in graphs
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Algorithmic aspects of Roman graphs
Cites work
- A characterization of Roman trees
- Algorithmic aspects of Roman domination in graphs
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Approximation algorithm for (connected) Italian dominating function
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Double Roman domination
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 6769213 (Why is no real title available?)
- Nearly tight approximation algorithm for (connected) Roman dominating set
- Roman \(\{2 \}\)-domination
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
- Roman domination in graphs.
- Total Roman reinforcement in graphs
- Triple Roman domination in graphs
- Varieties of Roman Domination
This page was built for publication: Approximation algorithm for the minimum partial connected Roman dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571270)
