Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem

标题
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
作者
关键词
-
出版物
EVOLUTIONARY COMPUTATION
Volume 19, Issue 4, Pages 673-691
出版商
MIT Press - Journals
发表日期
2011-08-13
DOI
10.1162/evco_a_00047

向作者/读者发起求助以获取更多资源

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More