A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems

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:
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Year:
2011

Citing 9
Cited 6

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

INFORMS Journal on Computing
Some Approximation Results in Multicasting

Some Approximation Results in Multicasting
Modeling and solving the rooted distance-constrained minimum spanning tree problem

Computers and Operations Research
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Computer Aided Systems Theory - EUROCAST 2009
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 hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Applied Intelligence

Stabilized branch-and-price for the rooted delay-constrained steiner tree problem

INOC'11 Proceedings of the 5th international conference on Network optimization
A multilevel heuristic for the rooted delay-constrained minimum spanning tree problem

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
A memetic algorithm and a solution archive for the rooted delay-constrained minimum spanning tree problem

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
On solving the rooted delay- and delay-variation-constrained steiner tree problem

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Shallow-Light steiner arborescences with vertex delays

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a layered graph model for delay-constrained minimum tree problems with a polynomial number of constraints which can be solved well for instances with low- to medium-sized sets of achievable delay values and not too high bounds. Layered graph models have been recently shown to frequently yield tight bounds in the context of hopor delay-constrained network design problems. However, since the size of the layered graph heavily depends on the size of the set of achievable delay values and the corresponding delay bound the practical applicability of these models is limited. To overcome this problem we introduce an iterative strategy in which an initially small layered graph is successively extended in order to tighten lower and upper bounds until convergence to the optimal solution. Computational results show the synergetic effectiveness of both approaches outperforming existing models in nearly all cases.