On the Clustered Steiner Tree Problem (Q2867108): 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/978-3-319-03780-6_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2402805681 / 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: An improved approximation algorithm for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Full and Bottleneck Full Steiner Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation algorithms for the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the selected-internal Steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The internal Steiner tree problem: Hardness and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better constant-factor approximation for selected-internal Steiner minimum tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the terminal Steiner tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The full Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for terminal Steiner 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: Eight-Fifth Approximation for the Path TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees and Optimization Problems / 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 04:17, 7 July 2024

scientific article
Language Label Description Also known as
English
On the Clustered Steiner Tree Problem
scientific article

    Statements

    On the Clustered Steiner Tree Problem (English)
    0 references
    0 references
    10 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    Steiner tree
    0 references
    NP-hardness
    0 references
    graph algorithm
    0 references
    0 references