相关论文: Remarks on d-Dimensional TSP Optimal Tour Length B…

We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportation requests appear over time and need to be served by a single server. We give a lower bound of 2.0585 on the competitive ratio, which is…

The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present paper, we provide a $5$-dimensional…

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…

We probed spin-spin correlations up to 725 K with 63Cu NQR in the S= 1/2 three-leg ladder Sr2Cu3O5. We present experimental evidence that below 300 K, weak inter-ladder coupling causes dimensional crossover of the spin-spin correlation…

Scaling violations are found in the phase-ordering two-dimensional Heisenberg [$O(3)$] model, which has non-singular topological textures, under dissipative non-conserved dynamics. Three separate length-scales are found: $L_T$ characterizes…

We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)

We present an exact formulation of the symmetric Traveling Salesman Problem (TSP) that replaces the classical edge-selection view with a surface-building approach. Instead of selecting edges to form a cycle, the model selects a set of…

In this paper, we study the spherical maximal operator $ M_E $ over $ E\subset [1,2]$, restricted to radial functions. In higher dimensions $ d\geq 3$, we establish a complete range of $ L^p-$improving estimates for $ M_E $. In two…

TSP (Traveling Salesman Problem), a classic NP-complete problem in combinatorial optimization, is of great significance in multiple fields. Exact algorithms for TSP are not practical due to their exponential time cost. Thus, approximate…

We study the quadratically regularized optimal transport (QOT) problem for quadratic cost and compactly supported marginals $\mu$ and $\nu$. It has been empirically observed that the optimal coupling $\pi_\epsilon$ for the QOT problem has…

I study the two-dimensional defects of the $d$ dimensional critical $O(N)$ model and the defect RG flows between them. By combining the $\epsilon$-expansion around $d = 4$ and $d = 6$ as well as large $N$ techniques, I find new conformal…

In this paper we propose some novel path planning strategies for a double integrator with bounded velocity and bounded control inputs. First, we study the following version of the Traveling Salesperson Problem (TSP): given a set of points…

We present a randomized approximation algorithm for computing traveling salesperson tours in undirected regular graphs. Given an $n$-vertex, $k$-regular graph, the algorithm computes a tour of length at most $\left(1+\frac{7}{\ln…

Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is studied on the triangular lattice in two dimensions (2D). The results are compared with that of the 2D square lattice. Clusters generated…

We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenness, we prove inapproximability of $14/15+\epsilon$ and…

In this paper, we will propose convex layers to the Traveling Salesman Problem (TSP). Firstly, we will focus on human performance on the TSP. Experimental data shows that untrained humans appear to have the ability to perform well in the…

In this talk we present the exact solution of the most general one-dimensional $O(N)$-invariant spin model taking values in the sphere $S^{N-1}$, with nearest-neighbour interactions, and we discuss the possible continuum limits. All these…

We find the sharp range for boundedness of the discrete bilinear spherical maximal function for dimensions $d \geq 5$. That is, we show that this operator is bounded on $l^{p}(\mathbb{Z}^d)\times l^{q}(\mathbb{Z}^d) \to l^{r}(\mathbb{Z}^d)$…

Consider networks on $n$ vertices at average density 1 per unit area. We seek a network that minimizes total length subject to some constraint on journey times, averaged over source-destination pairs. Suppose journey times depend on both…

The precession protocol involves measuring $P_3$, the probability that a uniformly precessing observable (like the position of a harmonic oscillator or a coordinate undergoing spatial rotation) is positive at one of three equally spaced…