Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2020.11.002 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3888545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interconnection trees in the plane. Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A textbook of graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Steiner trees in normed planes / 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: On shortest three-edge-connected Steiner networks with Euclidean distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum-weight \(k\)-edge connected Steiner networks on metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding component sizes of two-connected Steiner networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner ratio Gilbert-Pollak conjecture is still open / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner minimal trees with \(L_ p\) distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and complexity of the 2-connected Steiner network problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fermat--Torricelli problem in normed planes and spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3173253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-connected Steiner networks: structural properties / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2020.11.002 / rank
 
Normal rank

Latest revision as of 12:49, 17 December 2024

scientific article
Language Label Description Also known as
English
Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane
scientific article

    Statements

    Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (English)
    0 references
    0 references
    0 references
    0 references
    16 December 2020
    0 references
    Steiner network
    0 references
    2-connected
    0 references
    NP-completeness
    0 references
    normed plane
    0 references

    Identifiers