Perfect arborescence packing in preflow mincut graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Increasing digraph arc-connectivity by arc addition, reversal and complement
Discrete Applied Mathematics
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A unification of network coding and tree-packing (routing) theorems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient algorithms for computing all low s-t edge connectivities and related problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Foundations and Trends® in Networking
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
A new approach to splitting-off
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Covering skew-supermodular functions by hypergraphs of minimum total size
Operations Research Letters
| Hi-index | 0.06 |
Generalizing and unifying earlier results of W. Mader, and A. Frank and B. Jackson, we prove two splitting theorems concerning mixed graphs. By invoking these theorems we obtain min-max formulae for the minimum number of new edges to be added to a mixed graph so that the resulting graph satisfies local edge-connectivity prescriptions. An extension of Edmonds's theorem on disjoint arborescences is also deduced along with a new sufficient condition for the solvability of the edge-disjoint paths problem in digraphs. The approach gives rise to strongly polynomial algorithms for the corresponding optimization problems.