The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
SIAM Journal on Discrete Mathematics
Packing Steiner trees: a cutting plane algorithm and computational results
Mathematical Programming: Series A and B
The Steiner tree packing problem in VLSI design
Mathematical Programming: Series A and B
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Information Theory
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Multicast time maximization in energy constrained wireless networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Packing Steiner trees with identical terminal sets
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Characterizing achievable multicast rates in multi-hop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A unification of network coding and tree-packing (routing) theorems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Matrix games in the multicast networks: maximum information flows with network switching
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Separating distributed source coding from network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Packing directed cycles efficiently
Discrete Applied Mathematics
Packing element-disjoint steiner trees
ACM Transactions on Algorithms (TALG)
High-bandwidth data dissemination for large-scale distributed systems
ACM Transactions on Computer Systems (TOCS)
Utility maximization in peer-to-peer systems
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On routing in VLSI design and communication networks
Discrete Applied Mathematics
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs
Journal of Combinatorial Theory Series B
EURASIP Journal on Wireless Communications and Networking
Back-Edge Heuristic for Efficient Data Distribution in Grid Systems
ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Approaches to the Steiner Problem in Networks
Algorithmics of Large and Complex Networks
A Graph Reduction Step Preserving Element-Connectivity and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Disjoint bases in a polymatroid
Random Structures & Algorithms
On achieving group strategyproof information dissemination in wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
Importance sampling via load-balanced facility location
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Packing Steiner trees on four terminals
Journal of Combinatorial Theory Series B
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Secret key generation for a pairwise independent network model
IEEE Transactions on Information Theory
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Design is as Easy as Optimization
SIAM Journal on Discrete Mathematics
Strategyproof mechanisms for content delivery via layered multicast
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
On modelling of fair throughput allocation in overlay multicast networks
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
The generalized deadlock resolution problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Disjoint cycles: integrality gap, hardness, and approximation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Packing element-disjoint steiner trees
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Design is as easy as optimization
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On fair and optimal multi-source IP-multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Biclique completion problems for multicast network design
Discrete Optimization
Brief announcement: live streaming with utilities, quality and cost
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Algorithms for stochastic optimization of multicast content delivery with network coding
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A content centric approach to dissemination of information in vehicular networks
Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications
A practical network coding and routing scheme based on maximum flow combination
International Journal of Network Management
Revisiting a secret sharing approach to network codes
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Some further investigation on maximum throughput: does network coding really help?
Proceedings of the 24th International Teletraffic Congress
Utility maximization in peer-to-peer systems with applications to video conferencing
IEEE/ACM Transactions on Networking (TON)
Scalable network coding for wireless sensor network energy conservation
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.12 |
The Steiner packing problem is to find the maximum number of edge-disjoint subgraphs of a given graph G that connect a given set of required points S. This problem is motivated by practical applications in VLSI- layout and broadcasting, as well as theoretical reasons. In this paper, we study this problem and present an algorithm with an asymptotic approximation factor of |S|/4. This gives a sufficient condition for the existence of k edge-disjoint Steiner trees in a graph in terms of the edge-connectivity of the graph. We will show that this condition is the best possible if the number of terminals is 3. At the end, we consider the fractional version of this problem, and observe that it can be reduced to the minimum Steiner tree problem via the ellipsoid algorithm.