scientific article; zbMATH DE number 2079349
From MaRDI portal
Publication:4471308
zbMath1094.68612MaRDI QIDQ4471308
No author found.
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Packing Steiner trees with identical terminal sets ⋮ Graphs with large generalized (edge-)connectivity ⋮ Packing directed cycles efficiently ⋮ Greedy algorithms for the profit-aware social team formation problem ⋮ Packing Steiner trees on four terminals ⋮ A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case ⋮ Resource time-sharing for IoT applications with deadlines ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Biclique completion problems for multicast network design ⋮ Unnamed Item ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Galois geometries and coding theory ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Spanning trees: A survey ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ On routing in VLSI design and communication networks ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ A solution to a conjecture on the generalized connectivity of graphs ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ On the approximability of robust network design ⋮ Approximating the two-level facility location problem via a quasi-greedy approach ⋮ Disjoint bases in a polymatroid ⋮ Packing trees in communication networks ⋮ Approaches to the Steiner Problem in Networks ⋮ On fractional cut covers ⋮ Edge disjoint Steiner trees in graphs without large bridges ⋮ The Complexity of Contracts
This page was built for publication:
