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

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-015-9973-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-9973-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023646228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polymatroid Steiner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem on graphs: inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to trim a MST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for tour and tree covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the weight of shallow Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search and the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828915 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-015-9973-1 / rank
 
Normal rank

Latest revision as of 12:48, 9 December 2024

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