Methodology of Algorithm Engineering
Research on algorithms has drastically increased in recent years. Various sub-disciplines of computer science investigate algorithms according to different objectives and standards. This plurality of the field has led to various methodological advances that have not yet been transferred to neighboring sub-disciplines. The central roadblock for a better knowledge exchange is the lack of a common methodological framework integrating the perspectives of these sub-disciplines. It is the objective of this article to develop such a research framework for algorithm engineering. Our framework builds on three areas discussed in the philosophy of science: ontology, epistemology and methodology. The framework helps us to identify and discuss various validity concerns relevant for any contribution on algorithms in various areas of computer science.
Authors
- Henning Meyerhenke (ORCID: https://orcid.org/0000-0002-7769-726X)
- Henrik Leopold (ORCID: https://orcid.org/0000-0003-4862-1829)
- Benoît Depaire (ORCID: https://orcid.org/0000-0003-4735-0609)
- Jan Mendling (ORCID: https://orcid.org/0000-0002-7260-524X)
Institutions
- Vienna University of Economics and Business (AT)
- Karlsruhe Institute of Technology (DE)
- Hasso Plattner Institute (DE)
- University of Potsdam (DE)
- Kühne Logistics University (DE)
- Humboldt-Universität zu Berlin (DE)
- Weizenbaum Institute (DE)
- Hasselt University (BE)
Publication Details
- Journal
- ACM Computing Surveys
- Published
- 2025-09-22
- DOI
- https://doi.org/10.1145/3769071
- Citations
- 3
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 3.83