Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6560727 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
Steiner tree problem
Property / zbMATH Keywords: Steiner tree problem / rank
 
Normal rank
Property / zbMATH Keywords
 
directed graphs
Property / zbMATH Keywords: directed graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
greedy algorithm
Property / zbMATH Keywords: greedy algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
tree cover problem
Property / zbMATH Keywords: tree cover problem / rank
 
Normal rank

Revision as of 13:41, 27 June 2023

scientific article
Language Label Description Also known as
English
Multi-rooted greedy approximation of directed Steiner trees with applications
scientific article

    Statements

    Multi-rooted greedy approximation of directed Steiner trees with applications (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2016
    0 references
    approximation algorithms
    0 references
    Steiner tree problem
    0 references
    directed graphs
    0 references
    greedy algorithm
    0 references
    tree cover problem
    0 references

    Identifiers