Approximation algorithms for priority Steiner tree problems (Q2695278): 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 / OpenAlex ID
 
Property / OpenAlex ID: W3210324533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Priority Steiner Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design 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: Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design / 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: On the approximability of some network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / 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: <i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved methods for approximating node weighted Steiner trees and connected dominating sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the quality of service multicast tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Tier Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Node-Weighted Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grade of service Steiner minimum trees in the Euclidean plane / rank
 
Normal rank

Latest revision as of 20:45, 31 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for priority Steiner tree problems
scientific article

    Statements

    Approximation algorithms for priority Steiner tree problems (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references
    priority Steiner tree
    0 references
    approximation algorithms
    0 references
    network design
    0 references
    0 references
    0 references

    Identifiers