On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Highway Dimension and Provably Efficient Shortest Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: VC-Dimension and Shortest Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-hop minimum-spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized submodular cover problems and applications / 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: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-hop communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Steiner tree algorithms for bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow-Shallow-Low-Light Trees with and without Steiner Points / 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: A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Strikes Back: Improved Facility Location Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree embeddings for hop-constrained network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal graphs containing $n$ given points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vojtěch Jarník's work in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-hop minimum spanning trees in Euclidean metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing the embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem with hop constraints / rank
 
Normal rank

Revision as of 05:23, 29 July 2024

scientific article; zbMATH DE number 7537556
Language Label Description Also known as
English
On Hop-Constrained Steiner Trees in Tree-Like Metrics
scientific article; zbMATH DE number 7537556

    Statements

    On Hop-Constrained Steiner Trees in Tree-Like Metrics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 June 2022
    0 references
    \(k\)-hop Steiner tree
    0 references
    hop-constrained
    0 references
    dynamic programming
    0 references
    bounded treewidth
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references