Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems”
Year: 2019
Type: editorial
Abstract: 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.
Source: Algorithms
DOI: 10.3390/a12110229
Authors: Mattia D’Emidio, Daniele Frigioni
Institution: University of L'Aquila
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,013
OpenAlex ID: W2986765649