Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q294661
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Joseph Cheriyan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-011-9540-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180689556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint bases in a polymatroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Reduction Step Preserving Element-Connectivity and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and approximation results for packing Steiner trees / 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: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate balanced data gathering in energy-constrained sensor networks / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: A cutting plane algorithm and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: Further facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: Polyhedral investigations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner Trees: Separation Algorithms / 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: Q4386304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471308 / 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: Q3210200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate max-Steiner-tree-packing min-Steiner-cut theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4280133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiflow Feasibility: An Annotated Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4280135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of Steiner trees and \(S\)-connectors in graphs / rank
 
Normal rank

Latest revision as of 02:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
scientific article

    Statements

    Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    Steiner trees
    0 references
    packing
    0 references
    approximation algorithms
    0 references
    hardness of approximation
    0 references
    NP-hard
    0 references
    planar graphs
    0 references
    element connectivity
    0 references
    edge connectivity
    0 references
    partition connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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