Strong Steiner Tree Approximations in Practice (Q4629541): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / 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: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Influence of Preprocessing on Steiner Tree Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234114 / 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: Hypergraphic LP Relaxations for Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Steiner tree algorithms for bounded treewidth / 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: The Steiner tree problem on graphs: inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding Up Dynamic Programming with Representative Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and integrality gaps for hypergraphic steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partition-based relaxation for Steiner trees / 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 faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust and scalable algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner trees and minimum spanning trees in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNC-approximation algorithms for the steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / 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: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithm for optimum Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395337 / 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: Q4027204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank

Revision as of 22:35, 18 July 2024

scientific article; zbMATH DE number 7043416
Language Label Description Also known as
English
Strong Steiner Tree Approximations in Practice
scientific article; zbMATH DE number 7043416

    Statements

    Strong Steiner Tree Approximations in Practice (English)
    0 references
    0 references
    0 references
    27 March 2019
    0 references
    approximation algorithms
    0 references
    Steiner tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers