A (slightly) improved approximation algorithm for metric TSP
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 …
Approximation Algorithm for Metric TSP Anna R. Karlin karlin@cs.washington.edu …
A survey on algorithmic approaches for solving tourist trip design problems
D Gavalas, C Konstantopoulos, K Mastakas… - Journal of …, 2014 - Springer
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 …
interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours …
Efficient large-scale multi-drone delivery using transit networks
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 …
simultaneously across broad urban areas. Besides flying directly, drones can use public …
An introduction to temporal graphs: An algorithmic perspective
O Michail - Internet Mathematics, 2016 - Taylor & Francis
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 …
discrete and only the relationships between the participating entities may change and not …
Dependent randomized rounding via exchange properties of combinatorial structures
C Chekuri, J Vondrák… - 2010 IEEE 51st Annual …, 2010 - ieeexplore.ieee.org
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 …
P⊆[0, 1] n to a vertex X of P, so that E [X]= x. Our goal is to achieve concentration properties …
Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids
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 …
bases of a given matroid of rank r and the number of common bases of any two matroids of …
A new efficient hybrid algorithm for large scale multiple traveling salesman problems
C Jiang, Z Wan, Z Peng - Expert Systems with Applications, 2020 - Elsevier
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 …
salesman problem (TSP), but also more suitable for modeling practical problems in the real …
A general framework for graph sparsification
WS Fung, R Hariharan, NJA Harvey… - Proceedings of the forty …, 2011 - dl.acm.org
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 …
weighted subgraphs for which every cut has the same weight as the original graph, up to a …
Online stochastic max-weight matching: Prophet inequality for vertex and edge arrival models
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 …
bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex …
A randomized rounding approach to the traveling salesman problem
For some positive constant ϵ 0, we give a (3/2-ϵ 0)-approximation algorithm for the
following problem: given a graph G 0=(V, V 0), find the shortest tour that visits every vertex at …
following problem: given a graph G 0=(V, V 0), find the shortest tour that visits every vertex at …