A (Slightly) Improved Approximation Algorithm for Metric TSP Page 1 A (Slightly) Improved
Approximation Algorithm for Metric TSP Anna R. Karlin karlin@cs.washington.edu …

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 …

A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …

We consider the problem of routing a large fleet of drones to deliver packages
simultaneously across broad urban areas. Besides flying directly, drones can use public …

We consider the problem of randomly rounding a fractional solution x in an integer polytope
P⊆[0, 1] n to a vertex X of P, so that E [X]= x. Our goal is to achieve concentration properties …

We give a deterministic polynomial time 2^ O (r)-approximation algorithm for the number of
bases of a given matroid of rank r and the number of common bases of any two matroids of …

Multiple traveling salesmen problem (MTSP) is not only a generalization of the traveling
salesman problem (TSP), but also more suitable for modeling practical problems in the real …

We present a general framework for constructing cut sparsifiers in undirected graphs---
weighted subgraphs for which every cut has the same weight as the original graph, up to a …

We provide prophet inequality algorithms for online weighted matching in general (non-
bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex …

In this paper we give the first approximation algorithm for the problem of max-min fair
allocation of indivisible goods. The approximation ratio of our algorithm is Ω1√ k log3 k. As …