An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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: Steiner tree problem with minimum number of Steiner points and bounded edge-length / 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: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck Steiner trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for a bottleneck Steiner tree problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00209-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148678019 / rank
 
Normal rank

Latest revision as of 08:50, 30 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
scientific article

    Statements

    Identifiers