Special Issue "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems"

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: 28 February 2019

Special Issue Editors

Guest Editor
Prof. Daniele Frigioni

Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, Via Vetoio, I–67100 L’Aquila, Italy
Website | E-Mail
Interests: algorithms and data structures; algorithm engineering; distributed algorithms; large-scale optimization
Guest Editor
Dr. Mattia D'Emidio

Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, Via Vetoio, I–67100 L’Aquila, Italy
Website | E-Mail
Interests: design and efficient implementation of algorithms; experimental algorithmics; algorithms for massive datasets; distributed algorithms

Special Issue Information

Dear Colleagues,

Algorithm Engineering is a new and emerging discipline in which the aim is bridging the increasing gap between classical algorithm theory and algorithmics in practice. In particular, advancements in computer hardware have rendered traditional computer models more and more unrealistic, and have led to a constantly increasing demand for practically efficient solutions to real world problems. Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modelling, design, analysis, robust and efficient implementations to careful experiments.

The purpose of this Special Issue is to attract papers presenting original research in the area of Algorithm Engineering. In particular, we encourage submissions concerning the design, implementation, tuning, and experimental evaluation of discrete algorithms and data structures, or addressing methodological issues and standards in algorithmic experimentation. Papers dealing with advanced models of computing, including memory hierarchies, cloud architectures, and parallel processing are also welcome.

We solicit contributions from all relevant areas of applied algorithmic research which include but are not limited to: databases; geometry; graphs; big data; complex networks; combinatorial aspects of scientific computing; and computational problems in natural sciences or engineering.

Prof. Daniele Frigioni
Dr. Mattia D'Emidio
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 850 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Algorithm Engineering
  • Algorithms and Data Structures
  • Experimental Algorithmics
  • Algorithms for Large Scale Combinatorial Problems
  • Efficient Solutions for Real World Applications

Published Papers (1 paper)

View options order results:
result details:
Displaying articles 1-1
Export citation of selected articles as:

Research

Open AccessArticle Convex-Hull Algorithms: Implementation, Testing, and Experimentation
Algorithms 2018, 11(12), 195; https://doi.org/10.3390/a11120195
Received: 2 October 2018 / Revised: 22 November 2018 / Accepted: 23 November 2018 / Published: 28 November 2018
PDF Full-text (494 KB) | HTML Full-text | XML Full-text | Supplementary Files
Abstract
From a broad perspective, we study issues related to implementation, testing, and experimentation in the context of geometric algorithms. Our focus is on the effect of quality of implementation on experimental results. More concisely, we study algorithms that compute convex hulls for a
[...] Read more.
From a broad perspective, we study issues related to implementation, testing, and experimentation in the context of geometric algorithms. Our focus is on the effect of quality of implementation on experimental results. More concisely, we study algorithms that compute convex hulls for a multiset of points in the plane. We introduce several improvements to the implementations of the studied algorithms: plane-sweep, torch, quickhull, and throw-away. With a new set of space-efficient implementations, the experimental results—in the integer-arithmetic setting—are different from those of earlier studies. From this, we conclude that utmost care is needed when doing experiments and when trying to draw solid conclusions upon them. Full article
Figures

Figure 1

Back to Top