Special Issue "Algorithms for Shortest Paths in Dynamic and Evolving Networks"
Deadline for manuscript submissions: 30 November 2020.
Interests: innovative algorithmic technology; data-driven and scalable computing; large-scale optimization; intelligent transportation systems and services; decentralized computing; mobility in smart cities; cryptography and information security
Interests: design, analysis, and implementation of efficient algorithms and data structures
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.
Prof. Dr. Christos D. Zaroliagis
Dr. Daniel Delling
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 1000 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.
- Shortest-path algorithms
- Route planning
- Parametric shortest paths
- Temporal networks
- Dynamic networks
- Time-dependent networks
- Social networks
- Stochastic shortest paths