Arborescence optimization problems solvable by Edmonds' algorithm

Authors:
Leonidas Georgiadis
Affiliations:
Aristotle University of Thessaloniki, Faculty of Engineering, School of Electrical and Computer Engineering, Telecommunications Department, Thessaloniki 54124, Greece
Venue:
Theoretical Computer Science
Year:
2003

Citing 2
Cited 11

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Algorithms for two bottleneck optimization problems

Journal of Algorithms

Energy-aware broadcast trees in wireless networks

Mobile Networks and Applications
Non-projective dependency parsing using spanning tree algorithms

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Adding magic to an optimising datalog compiler

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Dependency Parsing by Transformation and Combination

GoTAL '08 Proceedings of the 6th international conference on Advances in Natural Language Processing
Low-complexity coding and source-optimized clustering for large-scale sensor networks

ACM Transactions on Sensor Networks (TOSN)
Web site topic-hierarchy generation based on link structure

Journal of the American Society for Information Science and Technology
Maximum spanning tree algorithm for non-projective labeled dependency parsing

CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Quadratic-time dependency parsing for machine translation

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
On the probabilistic min spanning tree Problem

Journal of Mathematical Modelling and Algorithms
Sort-sharing-aware query processing

The VLDB Journal — The International Journal on Very Large Data Bases
Extracting narrative timelines as temporal dependency structures

ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider a general class of optimization problems regarding spanning trees in directed graphs (arborescences). We present an algorithm for solving such problems, which can be considered as a generalization of Edmonds' algorithm for the solution of the minimum sum arborescence problem. The considered class of optimization problems includes as special cases the standard minimum sum arborescence problem, the bottleneck and lexicographically optimal arborescence problem, as well as the widest-minimum sum arborescence problem.