Approximating connected safe sets in weighted trees (Q2184684): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1711.11412 / rank
 
Normal rank
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 19:22, 22 July 2024

scientific article
Language Label Description Also known as
English
Approximating connected safe sets in weighted trees
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references