SPAA Archives

ACM SPAA Participants List

SPAA@LISTSERV.ACM.ORG

Options: Use Classic View

Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Content-Type: text/plain; charset=iso-8859-1
Date: Thu, 27 Feb 2020 18:42:53 +0200
Content-Disposition: inline
Reply-To: Christos Zaroliagis <[log in to unmask]>
From: Christos Zaroliagis <[log in to unmask]>
Message-ID: <[log in to unmask]>
MIME-Version: 1.0
Sender: ACM SPAA Participants List <[log in to unmask]>
Parts/Attachments: text/plain (81 lines)
Call for Contributions

---------------------------------------------------------------------------------------------
Journal: Algorithms (https://www.mdpi.com/journal/algorithms)

Special issue on "Algorithms for Shortest Paths in Dynamic and Evolving Networks"
https://www.mdpi.com/journal/algorithms/special_issues/Algorithms_Shortest_Paths_Networks

Guest Editors: Daniel Delling and Christos Zaroliagis

Submission deadline: 31 August 2020
---------------------------------------------------------------------------------------------

Contemporary technological infrastructures are dominated by a multitude of networks 
(transportation networks, social networks, communication networks, e-commerce networks, 
power networks, etc.) that are typically of a very large scale and impose as a routine 
task the computation of min-cost paths, while their characteristics usually evolve with 
time. The dynamicity and temporality of the network characteristics is often depicted by 
some kind of predetermined dependence of the metric on the actual time that each resource 
is used (e.g., traversal time of individual segments in road networks, packet-loss rate 
in IT networks, arc availability in social networks, etc.).

The aim of this Special Issue is to seek new algorithmic approaches for computing shortest 
paths in networks that change over time for several reasons. A typical (but nonexhaustive) 
list includes network changes either due to the nature of an underlying metric (time-dependent 
networks), or the insertion/deletion of nodes and arcs (dynamic networks), or the availability 
of arcs at specific time slots (temporal networks), or the uncertainty of arc costs (stochastic 
networks), or the fact that each arc is equipped with more than one arc-cost vector (parametric 
networks).

Original contributions are solicited on new shortest-path algorithms on dynamic and evolving 
networks, which can belong to the broad spectrum of design, analysis, and engineering of 
algorithms, and include theoretical design and analysis, extensive experimentation and algorithm 
engineering, and heuristics. Moreover, high-quality survey contributions will also be considered.

Topics of interest include (but are not limited to) the following:

  - Approximate shortest-path algorithms;
  - Algorithm engineering;
  - Multimodal route planning;
  - Uni- and multicriteria route planning;
  - Parametric shortest-path algorithms;
  - Shortest paths in dynamic networks;
  - Shortest-path heuristics;
  - Shortest paths in time-dependent networks;
  - Shortest-path oracles;
  - Shortest paths in temporal networks;
  - Shortest paths in social networks;
  - Centrality assessment in social networks;
  - Stochastic shortest paths


Manuscript Submission Information
---------------------------------

Manuscripts should be submitted online at www.mdpi.com by registering (www.mdpi.com/register) 
and logging in (www.mdpi.com/login) to this website. Once you are registered, click here 
(https://susy.mdpi.com/user/manuscripts/upload/?journal=algorithms) 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. In the latter case (of conference
proceedings papers), the submitted manuscript should provide at least 40% new content.

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 (https://www.mdpi.com/journal/algorithms/instructions). Algorithms is an international 
peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page (https://www.mdpi.com/journal/algorithms/instructions) 
before submitting a manuscript. The Article Processing Charge (APC - https://www.mdpi.com/about/apc) 
for publication in this open access (https://www.mdpi.com/about/openaccess) journal is 1000 CHF 
(Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use 
MDPI's English editing service (https://www.mdpi.com/authors/english) prior to publication or 
during author revisions. 

ATOM RSS1 RSS2