Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems”

Algorithms

Mattia D’Emidio¹  Daniele Frigioni¹ 

[1] Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, Via Vetoio, I–67100 L’Aquila, Italy;

关键词: journey planning;    temporal graphs;    influence maximization;    network analysis;    bamboo garden trimming problem;    convex hull;    experimental algorithmics;    algorithm engineering;    computational social choice;    statistical analysis of algorithms;    scheduling;    approximation algorithms;   

DOI  :  10.3390/a12110229

来源: DOAJ

【 摘 要 】

The purpose of this special issue of Algorithms was to attract papers presenting original research in the area of algorithm engineering. In particular, submissions concerning the design, analysis, implementation, tuning, and experimental evaluation of discrete algorithms and data structures, and/or addressing methodological issues and standards in algorithmic experimentation were encouraged. Papers dealing with advanced models of computing, including memory hierarchies, cloud architectures, and parallel processing were also welcome. In this regard, we solicited contributions from all most prominent areas of applied algorithmic research, which include but are not limited to graphs, databases, computational geometry, big data, networking, combinatorial aspects of scientific computing, and computational problems in the natural sciences or engineering.

【 授权许可】

Unknown