Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem-Reference-Cited by-同舟云学术

Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms - FOGA '19
language:
Short-container-title:

Author:

Shi Feng¹,Neumann Frank²,Wang Jianxin¹

Affiliation:

1. Central South University, Changsha, China

2. The University of Adelaide, Adelaide, Australia

Funder

Australian Research Council

National Natural Science Foundation of China

Publisher

ACM Press

Reference37 articles.

1. Laurent Alfandari and Vangelis Th Paschos. 1999. Approximating minimum spanning tree of depth 2. International Transactions in Operational Research 6, 6 (1999), 607--622.

2. Eric Angel, Evripidis Bampis, and Laurent Gourvés. 2004. Approximating the Pareto curve with local search for the bicriteria TSP (1, 2) problem. Theoretical Computer Science 310, 1--3 (2004), 135--146.

3. AE Baburin, Federico Della Croce, E Kh Gimadi, Yu V Glazkov, and V Th Paschos. 2009. Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Discrete Applied Mathematics 157, 9 (2009), 1988--1992.

4. Piotr Berman and Marek Karpinski. 2006. 8/7-approximation algorithm for (1, 2)-TSP. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. Society for Industrial and Applied Mathematics, 641--648.

5. Marshall Bern and Paul Plassmann. 1989. The Steiner problem with edge lengths 1 and 2. Inform. Process. Lett. 32, 4 (1989), 171--176.

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

1. Analisis Pengambilan Keputusan Mahkamah Konstitusi Terhadap Batas Usia Calon Presiden dan Calon Wakil Presiden Menggunakan Pendekatan Problem Tree Analysis;Indonesian Journal of Public Administration Review;2024-05-08

2. Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem;Theoretical Computer Science;2021-11

3. The lower bounds on the runtime of the (1 + (λ, λ)) GA on the minimum spanning tree problem;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2021-07-07