Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259): 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.1016/j.jcss.2018.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2885566559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / 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: Approximations for Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: On better heuristics for Steiner minimum trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems / 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: Q4194048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Survivable Networks with Minimum Number of Steiner Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relay placement for fault tolerance in wireless networks in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Uniform Connectivity Problems / 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: A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless network design via 3-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree minimum spanning trees / 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 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank

Latest revision as of 22:27, 16 July 2024

scientific article
Language Label Description Also known as
English
Approximating Steiner trees and forests with minimum number of Steiner points
scientific article

    Statements

    Approximating Steiner trees and forests with minimum number of Steiner points (English)
    0 references
    0 references
    0 references
    17 October 2018
    0 references
    wireless networks
    0 references
    unit-disc graph
    0 references
    Steiner tree
    0 references
    Steiner forest
    0 references
    2-connectivity
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references