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

• Main Authors: Mattia D’Emidio, Daniele Frigioni
• Format: Article
• Language: English
• Published: MDPI AG 2019-11-01
• Series: Algorithms
• Subjects: 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
• Online Access: https://www.mdpi.com/1999-4893/12/11/229

The purpose of this special issue of <i>Algorithms</i> 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.