You are currently viewing a new version of our website. To view the old version click .

Algorithms, Volume 13, Issue 11

November 2020 - 41 articles

Cover Story: We review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to model things such as waiting times at road junctions and delays due to transfers in public transport. The usual way of handling such penalties is through graph expansion. As an alternative, we propose two variants of Dijkstra’s algorithm that operate on the original, unexpanded graph. Analyses are then presented to gauge the relative advantages and disadvantages of these methods. Asymptotically, compared to using Dijkstra’s algorithm on expanded graphs, our first variant is faster for very sparse graphs but slower with dense graphs. In contrast, the second variant features identical worst-case run times. View this paper
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (41)

  • Article
  • Open Access
4 Citations
2,680 Views
14 Pages

Searching via Nonlinear Quantum Walk on the 2D-Grid

  • Giuseppe Di Molfetta and
  • Basile Herzog

23 November 2020

We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational ad...

  • Article
  • Open Access
6 Citations
4,412 Views
27 Pages

Finding the Best 3-OPT Move in Subcubic Time

  • Giuseppe Lancia and
  • Marcello Dalpasso

23 November 2020

Given a Traveling Salesman Problem solution, the best 3-OPT move requires us to remove three edges and replace them with three new ones so as to shorten the tour as much as possible. No worst-case algorithm better than the Θ(n3) enumeration of...

  • Article
  • Open Access
9 Citations
4,382 Views
14 Pages

23 November 2020

A Pseudo-Random Number Generator (PRNG) is any algorithm generating a sequence of numbers approximating properties of random numbers. These numbers are widely employed in mid-level cryptography and in software applications. Test suites are used to ev...

  • Article
  • Open Access
7 Citations
2,841 Views
24 Pages

20 November 2020

We develop a family of three-step sixth order methods with generic weight functions employed in the second and third sub-steps for solving nonlinear systems. Theoretical and computational studies are of major concern for the convergence behavior with...

  • Article
  • Open Access
10 Citations
3,555 Views
22 Pages

Combining Optimization and Simulation for Designing a Robust Short-Sea Feeder Network

  • Carl Axel Benjamin Medbøen,
  • Magnus Bolstad Holm,
  • Mohamed Kais Msakni,
  • Kjetil Fagerholt and
  • Peter Schütz

20 November 2020

Here we study a short-sea feeder network design problem based on mother and daughter vessels. The main feature of the studied system is performing transshipment of cargo between mother and daughter vessels at appropriate locations at sea. This operat...

  • Article
  • Open Access
25 Citations
5,508 Views
14 Pages

I3D-Shufflenet Based Human Action Recognition

  • Guocheng Liu,
  • Caixia Zhang,
  • Qingyang Xu,
  • Ruoshi Cheng,
  • Yong Song,
  • Xianfeng Yuan and
  • Jie Sun

18 November 2020

In view of difficulty in application of optical flow based human action recognition due to large amount of calculation, a human action recognition algorithm I3D-shufflenet model is proposed combining the advantages of I3D neural network and lightweig...

  • Article
  • Open Access
2 Citations
5,669 Views
23 Pages

Graphs from Features: Tree-Based Graph Layout for Feature Analysis

  • Rosane Minghim,
  • Liz Huancapaza,
  • Erasmo Artur,
  • Guilherme P. Telles and
  • Ivar V. Belizario

18 November 2020

Feature Analysis has become a very critical task in data analysis and visualization. Graph structures are very flexible in terms of representation and may encode important information on features but are challenging in regards to layout being adequat...

  • Article
  • Open Access
5 Citations
4,093 Views
15 Pages

Efficient Rule Generation for Associative Classification

  • Chartwut Thanajiranthorn and
  • Panida Songram

17 November 2020

Associative classification (AC) is a mining technique that integrates classification and association rule mining to perform classification on unseen data instances. AC is one of the effective classification techniques that applies the generated rules...

  • Article
  • Open Access
95 Citations
13,147 Views
16 Pages

Groundwater Prediction Using Machine-Learning Tools

  • Eslam A. Hussein,
  • Christopher Thron,
  • Mehrdad Ghaziasgar,
  • Antoine Bagula and
  • Mattia Vaccari

17 November 2020

Predicting groundwater availability is important to water sustainability and drought mitigation. Machine-learning tools have the potential to improve groundwater prediction, thus enabling resource planners to: (1) anticipate water quality in unsample...

  • Article
  • Open Access
5 Citations
5,100 Views
18 Pages

Modalflow: Cross-Origin Flow Data Visualization for Urban Mobility

  • Ignacio Pérez-Messina,
  • Eduardo Graells-Garrido,
  • María Jesús Lobo and
  • Christophe Hurter

15 November 2020

Pervasive data have become a key source of information for mobility and transportation analyses. However, as a secondary source, it has a different methodological origin than travel survey data, usually relying on unsupervised algorithms, and so it r...

of 5

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Algorithms - ISSN 1999-4893