Related papers: An Improved Upper Bound for the Euclidean TSP Cons…
Consider the problem of nonparametric estimation of an unknown $\beta$-H\"older smooth density $p_{XY}$ at a given point, where $X$ and $Y$ are both $d$ dimensional. An infinite sequence of i.i.d.\ samples $(X_i,Y_i)$ are generated…
Understanding the material parameters that control the superconducting transition temperature $T_c$ is a problem of fundamental importance. In many novel superconductors, phase fluctuations determine $T_c$, rather than the collapse of the…
The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3. This improves the previous time bounds of O^*(1.251^n) by Iwama and Nakashima and…
In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting…
Current theories of high-temperature superconductivity in flat-band systems predict a linear dependence of the transition temperature on the attractive interaction, $T_c(U) = c|U|$. However, neither the value of $c$ nor the full nonlinear…
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice $Z^d$. The method is based on loop erasure and restoration, and does not require exact…
$L^p$ to $L^p_{\beta}$ boundedness theorems are proven for translation invariant averaging operators over hypersurfaces in Euclidean space. The operators can either be Radon transforms or averaging operators with multiparameter fractional…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. We present a fast combinatorial $\frac…
A long-standing conjecture for the traveling salesman problem (TSP) states that the integrality gap of the standard linear programming relaxation of the TSP is at most 4/3. Despite significant efforts, the conjecture remains open. We…
Motivated by the pressing need for efficient optimization in online recommender systems, we revisit the cascading bandit model proposed by Kveton et al. (2015). While Thompson sampling (TS) algorithms have been shown to be empirically…
The greedy and nearest-neighbor TSP heuristics can both have $\log n$ approximation factors from optimal in worst case, even just for $n$ points in Euclidean space. In this note, we show that this approximation factor is only realized when…
In this paper, we investigate eigenvalues of Laplacian on a bounded domain in an $n$-dimensional Euclidean space and obtain a sharper lower bound for the sum of its eigenvalues, which gives an improvement of results due to A. D. Melas [15].…
This paper studies length estimates for trajectories on flat cone surfaces in terms of their self-intersection numbers. For an area-one flat cone surface, we obtain a lower bound for the length of a trajectory, with constants depending only…
We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, $(4.8^2)$, and $(3.12^2)$ lattices. The bound is found by Kesten's method of irreducible bridges. This involves…
The celebrated Littlewood-Offord problem asks for an upper bound on the probability that the random variable $\epsilon_1 v_1 + \cdots + \epsilon_n v_n$ lies in the Euclidean unit ball, where $\epsilon_1, \ldots, \epsilon_n \in \{-1, 1\}$…
We analyze simulated annealing (SA) for simple randomized instances of the Traveling Salesperson Problem. Our analysis shows that the theoretically optimal cooling schedule of Hajek explores members of the solution set which are in…
We consider a Bolza type optimal control problem of the form \begin{equation}\min J_{t}(y,u):=\int_t^T\Lambda(s,y(s), u(s))\,ds+g(y(T))\tag{P$_{t,x}$}\end{equation} Subject to: \begin{equation}\label{tag:admissible}\tag{D}\begin{cases} y\in…
We introduce a fast, quasi-linear-time heuristic for the Close-Enough Traveling Salesman Problem (CETSP), a continuous generalization of the Euclidean TSP in which each target is a disk that must be intersected. The method adapts the…
We obtain improved lower bounds for additive spanners, additive emulators, and diameter-reducing shortcut sets. Spanners and emulators are sparse graphs that approximately preserve the distances of a given graph. A shortcut set is a set of…