The tourist trip design problem (TTDP) refers to a route-planning problem for tourists
interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours …

Planning a trip with an electric vehicle requires consideration of both battery dynamics and
the availability of charging infrastructure. Recharging costs for an electric vehicle, which …

The algorithmic challenge of maximizing information diffusion through word-of-mouth
processes in social networks has been heavily studied in the past decade. While there has …

Consider a network design application where we wish to lay down a minimum-cost
spanning tree in a given graph; however, we only have stochastic information about the …

The stochastic matching problem deals with finding a maximum matching in a graph whose
edges are unknown but can be accessed via queries. This is a special case of stochastic k …

Suppose we are given a submodular function f over a set of elements, and we want to
maximize its value subject to certain constraints. Good approximation algorithms are known …

A stochastic probing problem consists of a set of elements whose values are independent
random variables. The algorithm knows the distributions of these variables, but not the …

Our main contribution is a general framework to design efficient polynomial time
approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization …

We consider constrained versions of the prize-collecting traveling salesman and the prize-
collecting minimum spanning tree problems. The goal is to maximize the number of vertices …

Consider a group of people who are visiting a major touristic city, such as NY, Paris, or
Rome. It is reasonable to assume that each member of the group has his or her own …