Approximating connected safe sets in weighted trees (Q2184684): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Safe sets in graphs: graph classes and structural parameters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Network majority on tree topological network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Safe sets, network majority on weighted trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the weighted safe set problem on paths and cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Safe set problem on graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank | |||
Normal rank |
Latest revision as of 20:22, 22 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating connected safe sets in weighted trees |
scientific article |
Statements
Approximating connected safe sets in weighted trees (English)
0 references
29 May 2020
0 references
safe set
0 references
connected safe set
0 references
block graph
0 references