Hardness and approximation results for packing Steiner trees (Q2369873): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized metarounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating theDomatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing a hypergraph into \(k\) connected sub-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree packing problem in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees with identical terminal sets / 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: Approximating disjoint-path problems using packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint trees containing some given vertices in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4280133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511239 / rank
 
Normal rank

Latest revision as of 09:20, 26 June 2024

scientific article
Language Label Description Also known as
English
Hardness and approximation results for packing Steiner trees
scientific article

    Statements

    Hardness and approximation results for packing Steiner trees (English)
    0 references
    0 references
    0 references
    21 June 2007
    0 references
    packing edge-disjoint Steiner trees of undirected graphs
    0 references
    packing Steiner-node-disjoint Steiner trees of undirected graphs
    0 references

    Identifiers

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