scientific article; zbMATH DE number 2079349
From MaRDI portal
Publication:4471308
Recommendations
Cited in
(39)- Packing trees in communication networks
- The Steiner tree packing problem in VLSI design
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- Packing Steiner trees: Further facets
- On the approximability of robust network design
- Greedy algorithms for the profit-aware social team formation problem
- On fractional cut covers
- Packing Steiner trees with identical terminal sets
- Biclique completion problems for multicast network design
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Approximating the least core value and least core of cooperative games with supermodular costs
- Approximating the two-level facility location problem via a quasi-greedy approach
- Packing Steiner trees
- Disjoint bases in a polymatroid
- Packing the Steiner trees of a graph
- Graphs with large generalized (edge-)connectivity
- Packing Steiner Forests
- Approaches to the Steiner Problem in Networks
- Edge disjoint Steiner trees in graphs without large bridges
- scientific article; zbMATH DE number 108281 (Why is no real title available?)
- scientific article; zbMATH DE number 508831 (Why is no real title available?)
- Packing element-disjoint steiner trees
- Greedy algorithms for online survivable network design
- 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
- Algorithms – ESA 2004
- The complexity of contracts
- Packing Steiner trees on four terminals
- Resource time-sharing for IoT applications with deadlines
- Spanning trees: A survey
- Splitting-off in hypergraphs
- Splitting-off in hypergraphs
- Fault tolerant max-cut
- Packing directed cycles efficiently
- On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
- Galois geometries and coding theory
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- On routing in VLSI design and communication networks
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
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)
