scientific article; zbMATH DE number 2079349

zbMATH Open1094.68612MaRDI QIDQ4471308FDOQ4471308

Authors:

Publication date: 28 July 2004

Title of this publication is not available (Why is that?)

Recommendations

• Packing element-disjoint steiner trees
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Packing Steiner Forests
• Packing the Steiner trees of a graph

zbMATH Keywords

Steiner packing problem

Mathematics Subject Classification ID

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

Cited In (35)

• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Greedy algorithms for the profit-aware social team formation problem
• The complexity of contracts
• Packing element-disjoint steiner trees
• Packing Steiner trees
• Constructing edge-disjoint Steiner paths in lexicographic product networks
• A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
• A solution to a conjecture on the generalized connectivity of graphs
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• Spanning trees: A survey
• Edge disjoint Steiner trees in graphs without large bridges
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• Greedy algorithms for online survivable network design
• Packing the Steiner trees of a graph
• On the approximability of robust network design
• Packing Steiner trees on four terminals
• Packing Steiner trees: Further facets
• Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
• Approaches to the Steiner Problem in Networks
• Packing Steiner Forests
• Approximating the two-level facility location problem via a quasi-greedy approach
• Graphs with large generalized (edge-)connectivity
• Disjoint bases in a polymatroid
• Approximating the least core value and least core of cooperative games with supermodular costs
• Packing directed cycles efficiently
• Galois geometries and coding theory
• Title not available (Why is that?)
• Packing Steiner trees with identical terminal sets
• The Steiner tree packing problem in VLSI design
• Algorithms – ESA 2004
• Resource time-sharing for IoT applications with deadlines
• On routing in VLSI design and communication networks
• On fractional cut covers
• Packing trees in communication networks
• Biclique completion problems for multicast network design

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471308)