Packing trees in communication networks
From MaRDI portal
Publication:1016048
DOI10.1007/s10878-008-9150-4zbMath1163.90656OpenAlexW2087455919MaRDI QIDQ1016048
Hu Zhang, Anthony Vannelli, Tamás Terlaky, Mohamed Khalifa Saad
Publication date: 4 May 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9150-4
communication networksmathematical programmingapproximation algorithmsmulticast routingwavelength assignmentSteiner tree packing
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster and simpler approximation algorithms for mixed packing and covering problems
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- The Steiner problem with edge lengths 1 and 2
- The ellipsoid method and its consequences in combinatorial optimization
- The Steiner tree packing problem in VLSI design
- Minimum \(k\) arborescences with bandwidth constraints
- Packing Steiner trees: A cutting plane algorithm and computational results
- On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
- Packing Steiner trees with identical terminal sets
- Assign ranges in general ad-hoc networks
- An improved approximation algorithm for multicast \(k\)-tree routing
- Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
- Proof verification and the hardness of approximation problems
- Randomized metarounding (extended abstract)
- Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
- Packing Steiner Forests
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- Two Steiner tree packing problems
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Packing Steiner Trees: Separation Algorithms
- Coordination Complexity of Parallel Price-Directive Decomposition
- Structural Information and Communication Complexity
- Algorithms – ESA 2004
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Experimental and Efficient Algorithms
- Algorithmic Applications in Management
- Integer Programming and Combinatorial Optimization
- Computing and Combinatorics
- Algorithms and Computation
- A branch-and-price algorithm for the Steiner tree packing problem.
- Heuristic algorithms for packing of multiple-group multicasting
This page was built for publication: Packing trees in communication networks
