A practical greedy approximation for the directed Steiner tree problem (Q346528): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-016-0074-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2518649733 / 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: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction-Based Steiner Tree Approximations in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed dual ascent algorithm for Steiner problems in multicast routing / 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: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distributed multicast routing in point-to-point networks / 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: Fast Local Search for Steiner Trees in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Greedy Approximation for the Directed Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank
 
Normal rank

Latest revision as of 00:59, 13 July 2024

scientific article
Language Label Description Also known as
English
A practical greedy approximation for the directed Steiner tree problem
scientific article

    Statements

    A practical greedy approximation for the directed Steiner tree problem (English)
    0 references
    0 references
    0 references
    29 November 2016
    0 references
    0 references
    directed Steiner tree
    0 references
    approximation algorithm
    0 references
    greedy algorithm
    0 references
    0 references