Approximating fault-tolerant group-Steiner problems (Q764316): 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: W2037655022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buy-at-Bulk Network Design with Protection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / 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: Q3549697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-Stretch Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network 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: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximation for Vertex-Connectivity Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the weight of shallow Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of survivable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable network design with degree or order constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Steiner Networks with Node Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank
 
Normal rank

Latest revision as of 00:27, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximating fault-tolerant group-Steiner problems
scientific article

    Statements

    Approximating fault-tolerant group-Steiner problems (English)
    0 references
    0 references
    0 references
    0 references
    13 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    group Steiner
    0 references
    connectivity
    0 references
    fault tolerance
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references