Abstract
Minimum-weight arborescence problems have recently enjoyed an increased attention due to their relation to imporant problems in computer vision. A prominent example is the automated reconstruction of consistent tree structures from noisy images. In this paper, we first propose a heuristic for tackling the minimum-weight rooted arborescence problem. Moreover, we propose an ant colony optimization algorithm. Both approaches are strongly based on dynamic programming, and can therefore be regarded as hybrid techniques. An extensive experimental evaluation shows that both algorithms generally improve over an exisiting heuristic from the literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, C.: Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research 177(1), 102–114 (2007)
Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics – Part B 34(2), 1161–1172 (2004)
Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11(6), 4135–4151 (2011)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Duhamel, C., Gouveia, L., Moura, P., Souza, M.: Models and heuristics for a minimum arborescence problem. Networks 51(1), 34–47 (2008)
Stützle, T., Hoos, H.H.: \(\mathcal{MAX-MIN}\) Ant System. Future Generation Computer Systems 16(8), 889–914 (2000)
Türetken, E., Benmansour, F., Fua, P.: Automated reconstruction of tree structures using path classifiers and mixed integer programming. In: Proceedings of CVPR 2012 – 25th IEEE Conference on Computer Vision and Pattern Recognition. IEEE Press (in press, 2012)
Türetken, E., González, G., Blum, C., Fua, P.: Automated reconstruction of dendritic and axonal trees by global optimization with geometric priors. Neuroinformatics 9(2-3), 279–302 (2011)
Tutte, W.T.: Graph Theory. Cambridge University Press, Cambridge (2001)
Venkata Rao, V., Sridharan, R.: Minimum-weight rooted not-necessarily-spanning arborescence problem. Networks 39(2), 77–87 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mateo, S., Blum, C., Fua, P., Türetgen, E. (2012). Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2012. Lecture Notes in Computer Science, vol 7461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32650-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-32650-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32649-3
Online ISBN: 978-3-642-32650-9
eBook Packages: Computer ScienceComputer Science (R0)