Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.STACS.2019.25 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set connectivity problems in undirected graphs and the directed steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Algorithms for Bidirected Steiner Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner minimal trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems as Hard as CNF-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design networks with bounded pairwise distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming for minimum Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree width, bramble size, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Arc-Weighted Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963676274 / rank
 
Normal rank
Property / title
 
Complexity of the Steiner Network Problem with Respect to the Number of Terminals (English)
Property / title: Complexity of the Steiner Network Problem with Respect to the Number of Terminals (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.STACS.2019.25 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:53, 30 December 2024

scientific article; zbMATH DE number 7559134
Language Label Description Also known as
English
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
scientific article; zbMATH DE number 7559134

    Statements

    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    directed Steiner network
    0 references
    planar graphs
    0 references
    parameterized algorithms
    0 references
    bounded genus
    0 references
    exponential time hypothesis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Complexity of the Steiner Network Problem with Respect to the Number of Terminals (English)
    0 references

    Identifiers