scientific article; zbMATH DE number 2119644
From MaRDI portal
Publication:4828915
zbMath1093.68629MaRDI QIDQ4828915
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (20)
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm ⋮ Lehman's Theorem and the Directed Steiner Tree Problem ⋮ On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree ⋮ Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems ⋮ Online Buy-at-Bulk Network Design ⋮ The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy ⋮ Improved approximation algorithms for directed Steiner forest ⋮ On the edge capacitated Steiner tree problem ⋮ Approximation algorithms for multicast routing in ad hoc wireless networks ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Register loading via linear programming ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Complexity of Steiner Tree in Split Graphs - Dichotomy Results ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks ⋮ Homogeneous 2-hop broadcast in 2D ⋮ The polymatroid Steiner problems ⋮ A greedy approximation algorithm for the group Steiner problem ⋮ On fixed cost \(k\)-flow problems ⋮ Multi-rooted greedy approximation of directed Steiner trees with applications
This page was built for publication:
