On solving the rooted delay- and delay-variation-constrained steiner tree problem

Authors:
Mario Ruthmair;Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 10
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Cost, Delay, and Delay Variation Conscious Multicast Routing

Cost, Delay, and Delay Variation Conscious Multicast Routing
Modeling and solving the rooted distance-constrained minimum spanning tree problem

Computers and Operations Research
Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing

Computer Communications
Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Mathematical Programming: Series A and B
A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Computer Communications
Distributed multicast routing, with end-to-end delay and delay variation constraints

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present mixed integer programming approaches for optimally solving a combinatorial optimization problem arising in network design with additional quality of service constraints. The rooted delay- and delay-variation-constrained Steiner tree problem asks for a cost-minimal Steiner tree satisfying delay-constraints from source to terminals and a maximal variation-bound between particular terminal path-delays. Our MIP models are based on multi-commodity-flows and a layered graph transformation. For the latter model we propose some new sets of valid inequalities and an efficient separation method. Presented experimental results indicate that our layered graph approaches clearly outperform the flow-based model.