[HTML][HTML] On-demand ridesharing with optimized pick-up and drop-off walking locations
On-demand systems in which passengers with similar routes can share a vehicle are
expected to become a relevant part of future mobility, thanks to their flexibility and their …
expected to become a relevant part of future mobility, thanks to their flexibility and their …
Additively homomorphical encryption based deep neural network for asymmetrically collaborative machine learning
The financial sector presents many opportunities to apply various machine learning
techniques. Centralized machine learning creates a constraint which limits further …
techniques. Centralized machine learning creates a constraint which limits further …
The traveling salesman problem with drone resupply
This paper treats a variant of the famous Traveling Salesman Problem (TSP), which is
extended to cover the peculiarities of a novel, drone-based distribution concept in last-mile …
extended to cover the peculiarities of a novel, drone-based distribution concept in last-mile …
An improved approximation algorithm for ATSP
We revisit the constant-factor approximation algorithm for the asymmetric traveling salesman
problem by Svensson, Tarnawski, and Végh [STOC 2018]. We improve on each part of this …
problem by Svensson, Tarnawski, and Végh [STOC 2018]. We improve on each part of this …
Novel properties of hierarchical probabilistic partitions and their algorithmic applications
We present a refined construction of hierarchical probabilistic partitions with novel
properties, substantially stronger than previously known. Our construction provides a family …
properties, substantially stronger than previously known. Our construction provides a family …
The temporal explorer who returns to the base
We study here the problem of exploring a temporal graph when the underlying graph is a
star. The aim of the exploration problem in a temporal star is finding a temporal walk which …
star. The aim of the exploration problem in a temporal star is finding a temporal walk which …
Bi-sided facility location problems: an efficient algorithm for k-centre, k-median, and travelling salesman problems
This study introduces a general framework, called Bi-sided facility location, for a wide range
of problems in the area of combined facility location and routing problems such as locating …
of problems in the area of combined facility location and routing problems such as locating …
An improved approximation algorithm for the asymmetric traveling salesman problem
We revisit the constant-factor approximation algorithm for the asymmetric traveling salesman
problem by Svensson, Tarnawski, and Végh J. ACM, 67 (2020), 37. We improve on each …
problem by Svensson, Tarnawski, and Végh J. ACM, 67 (2020), 37. We improve on each …
Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
We consider the following general network design problem. The input is an asymmetric
metric (V, c), root r∈ V, monotone submodular function f: 2 V→ R+, and budget B. The goal …
metric (V, c), root r∈ V, monotone submodular function f: 2 V→ R+, and budget B. The goal …
An automated approach for classifying reverse-engineered and forward-engineered UML class diagrams
UML Class diagrams are commonly used to describe the designs of systems. Such designs
can be used to guide the construction of software. In practice, we have identified two main …
can be used to guide the construction of software. In practice, we have identified two main …