scientific article; zbMATH DE number 1303557

zbMath0930.68107MaRDI QIDQ4250182

To-yat Cheung, Sudipto Guha, Zuo Dai, Ashish Goel, Chandra Chekuri, Ming Li, Moses Charikar

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Steiner tree problemdirected graphsSteiner network problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (17)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Directed Steiner trees with diffusion costs ⋮ An approximation algorithm for the \(k\)-level concentrator location problem ⋮ Unnamed Item ⋮ Bayesian generalized network design ⋮ GMPLS label space minimization through hypergraph layouts ⋮ Subjectively interesting connecting trees and forests ⋮ On the edge capacitated Steiner tree problem ⋮ Graph Clustering using Effective Resistance ⋮ Approximation algorithms for multicast routing in ad hoc wireless networks ⋮ Unnamed Item ⋮ Approximability of unsplittable shortest path routing problems ⋮ Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems ⋮ Algorithms for a network design problem with crossing supermodular demands ⋮ Designing Hypergraph Layouts to GMPLS Routing Strategies ⋮ Approximating the weight of shallow Steiner trees ⋮ Steiner Problems with Limited Number of Branching Nodes

This page was built for publication: