This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...
Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilke...