Approximating connected safe sets in weighted trees
From MaRDI portal
Publication:2184684
DOI10.1016/j.dam.2019.11.017zbMath1440.05109arXiv1711.11412OpenAlexW2994296736MaRDI QIDQ2184684
Stefan Ehard, Dieter Rautenbach
Publication date: 29 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.11412
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial aspects of block designs (05B05) Deterministic network models in operations research (90B10) Signed and weighted graphs (05C22) Graph designs and isomorphic decomposition (05C51)
Related Items (6)
On the weighted safe set problem on paths and cycles ⋮ Safe sets and in-dominating sets in digraphs ⋮ A combinatorial branch and bound for the safe set problem ⋮ Parameterized Complexity of Safe Set ⋮ Stable structure on safe set problems in vertex-weighted graphs ⋮ On the connected safe number of some classes of graphs
Cites Work
- Safe set problem on graphs
- Network majority on tree topological network
- Safe sets in graphs: graph classes and structural parameters
- On the weighted safe set problem on paths and cycles
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Safe sets, network majority on weighted trees
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Approximating connected safe sets in weighted trees
