A Survey on Multiple Objective Minimum Spanning Tree Problems-Reference-Cited by-同舟云学术

A Survey on Multiple Objective Minimum Spanning Tree Problems

Published:2009 Issue: Volume: Page:104-116
ISSN:0302-9743
Container-title:Algorithmics of Large and Complex Networks
language:
Short-container-title:

Author:

Ruzika Stefan,Hamacher Horst W.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02094-0_6

Reference37 articles.

1. Aggarwal, V., Aneja, Y.P., Nair, K.P.K.: Minimal spanning tree subject to a side constraint. Computers and Operations Research 9(4), 287–296 (1982)

2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Englewood Cliffs (1993)

3. Andersen, K.A., Joernsten, K., Lind, M.: On bicriterion minimal spanning trees: an approximation. Computers and Operations Research 23, 1171–1182 (1996)

4. Camerini, P.M., Galbiati, G., Maffioli, F.: The complexity of multi-constrained spanning tree problems. In: Lovasz, L. (ed.) Theory of Algorithms, pp. 53–101. North-Holland, Amsterdam (1984)

5. Chen, G., Guo, W., Tu, X., Chen, H.: An improved algorithm to solve the multi-criteria minimum spanning tree problem. J. Softw. 17(3), 364–370 (2006)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Using Trust Measures to Optimize Neighbor Selection for Smart Blockchain Networks in IoT;IEEE Internet of Things Journal;2023-12-15

2. Biobjective optimization problems on matroids with binary costs;Optimization;2022-03-07

3. Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs;Information Processing Letters;2021-08

4. A Bio-Inspired-Based Degree Constrained MST Algorithm for Cognitive Radio Networks;Information and Communication Technology for Competitive Strategies (ICTCS 2020);2021-07-27

5. Finding multi-objective supported efficient spanning trees;Computational Optimization and Applications;2021-01-25