Related papers: Slightly Improved Upper Bound on the Integrality R…
See hep-th/9907179.
We seek to derive the probability--expressed in terms of the Hilbert-Schmidt (Euclidean or flat) metric--that a generic (nine-dimensional) real two-qubit system is separable, by implementing the well-known Peres-Horodecki test on the…
Strong stability preserving (SSP) coefficients govern the maximally allowable step-size at which positivity or contractivity preservation of integration methods for initial value problems is guaranteed. In this paper, we show that the task…
Distribution networks are usually multiphase and radial. To facilitate power flow computation and optimization, two semidefinite programming (SDP) relaxations of the optimal power flow problem and a linear approximation of the power flow…
Given a stable L\'{e}vy process $X=(X_t)_{0\le t\le T}$ of index $\alpha\in(1,2)$ with no negative jumps, and letting $S_t=\sup_{0\le s\le t}X_s$ denote its running supremum for $t\in [0,T]$, we consider the optimal prediction problem…
The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs.…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G = (V, E) and non-negative distances d for every edge, the TSP asks for a shortest tour through all vertices with…
In this article we continue the study of smooth Poisson-Cauchy Type singular integral operators on the line regarding their convergence to the unit operator with rates in the Lp norm, p greater equal one. The related established…
We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear inequalities that outer approximate the positive semidefinite…
In Asymmetric A Priori TSP (with independent activation probabilities) we are given an instance of the Asymmetric Traveling Salesman Problem together with an activation probability for each vertex. The task is to compute a tour that…
Solutions to elliptic equations often exhibit higher regularity properties such as \emph{higher integrability}. That is, for instance, a solution $u$ to a system that a priori only satisfies $ u \in W^{1,r}$ is more regular and even in the…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
We introduce the first differentiable approximation of range-partition entropy, a complexity measure from computational geometry that directly bounds algorithmic runtime. Unlike architectural modifications, our method is a complementary…
Recent research in robust optimization has shown an overfitting-like phenomenon in which models trained against adversarial attacks exhibit higher robustness on the training set compared to the test set. Although previous work provided…
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP) that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation…
We design and analyse approximation algorithms for the minimum-cost connected T-join problem: given an undirected graph G = (V;E) with nonnegative costs on the edges, and a subset of nodes T, find (if it exists) a spanning connected…
This paper is a revised version of our recent publication Faber et al., Phys. Rev. D62 (2000) 025019, hep-th/9907048. The main revision concerns the expansion into group characters that we have used for the evaluation of path integrals over…
This technical report provides additional results for the main paper ``Probabilistic bounds on the $k-$Traveling Salesman Problem ($k-$TSP) and the Traveling Repairman Problem (TRP)''. For the $k-$TSP, we extend the probabilistic bounds…
Simple upper and lower bounds are obtained for the integral $\int_0^x\mathrm{e}^{-\gamma t}t^\nu I_\nu(t)\,\mathrm{d}t$, $x>0$, $\nu>-\frac{1}{2}$, $0<\gamma<1$. Most of our bounds for this integral are tight as $x\rightarrow\infty$. We…