Publication:4828915
From MaRDI portal
zbMath1093.68629MaRDI QIDQ4828915
Publication date: 29 November 2004
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Online Buy-at-Bulk Network Design, Parameterized Complexity of Directed Steiner Tree on Sparse Graphs, On fixed cost \(k\)-flow problems, Multi-rooted greedy approximation of directed Steiner trees with applications, On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree, Improved approximation algorithms for directed Steiner forest, Approximation algorithms for multicast routing in ad hoc wireless networks, Approximating \(k\)-generalized connectivity via collapsing HSTs, Register loading via linear programming, Homogeneous 2-hop broadcast in 2D, Clearing directed subgraphs by mobile agents. Variations on covering with paths, The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy, On the edge capacitated Steiner tree problem, The polymatroid Steiner problems, A greedy approximation algorithm for the group Steiner problem, Complexity of Steiner Tree in Split Graphs - Dichotomy Results, Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks, Lehman's Theorem and the Directed Steiner Tree Problem
