412 research outputs found
Fine-Grained Complexity Analysis of Two Classic TSP Variants
We analyze two classic variants of the Traveling Salesman Problem using the
toolkit of fine-grained complexity. Our first set of results is motivated by
the Bitonic TSP problem: given a set of points in the plane, compute a
shortest tour consisting of two monotone chains. It is a classic
dynamic-programming exercise to solve this problem in time. While the
near-quadratic dependency of similar dynamic programs for Longest Common
Subsequence and Discrete Frechet Distance has recently been proven to be
essentially optimal under the Strong Exponential Time Hypothesis, we show that
bitonic tours can be found in subquadratic time. More precisely, we present an
algorithm that solves bitonic TSP in time and its bottleneck
version in time. Our second set of results concerns the popular
-OPT heuristic for TSP in the graph setting. More precisely, we study the
-OPT decision problem, which asks whether a given tour can be improved by a
-OPT move that replaces edges in the tour by new edges. A simple
algorithm solves -OPT in time for fixed . For 2-OPT, this is
easily seen to be optimal. For we prove that an algorithm with a runtime
of the form exists if and only if All-Pairs
Shortest Paths in weighted digraphs has such an algorithm. The results for
may suggest that the actual time complexity of -OPT is
. We show that this is not the case, by presenting an algorithm
that finds the best -move in time for
fixed . This implies that 4-OPT can be solved in time,
matching the best-known algorithm for 3-OPT. Finally, we show how to beat the
quadratic barrier for in two important settings, namely for points in the
plane and when we want to solve 2-OPT repeatedly.Comment: Extended abstract appears in the Proceedings of the 43rd
International Colloquium on Automata, Languages, and Programming (ICALP 2016
EPR-based ghost imaging using a single-photon-sensitive camera
Correlated photon imaging, popularly known as ghost imaging, is a technique whereby an image is formed from light that has never interacted with the object. In ghost imaging experiments, two correlated light fields are produced. One of these fields illuminates the object, and the other field is measured by a spatially resolving detector. In the quantum regime, these correlated light fields are produced by entangled photons created by spontaneous parametric down-conversion. To date, all correlated photon ghost imaging experiments have scanned a single-pixel detector through the field of view to obtain spatial information. However, scanning leads to poor sampling efficiency, which scales inversely with the number of pixels, N, in the image. In this work, we overcome this limitation by using a time-gated camera to record the single-photon events across the full scene. We obtain high-contrast images, 90%, in either the image plane or the far field of the photon pair source, taking advantage of the Einstein–Podolsky–Rosen-like correlations in position and momentum of the photon pairs. Our images contain a large number of modes, >500, creating opportunities in low-light-level imaging and in quantum information processing
On Embeddability of Buses in Point Sets
Set membership of points in the plane can be visualized by connecting
corresponding points via graphical features, like paths, trees, polygons,
ellipses. In this paper we study the \emph{bus embeddability problem} (BEP):
given a set of colored points we ask whether there exists a planar realization
with one horizontal straight-line segment per color, called bus, such that all
points with the same color are connected with vertical line segments to their
bus. We present an ILP and an FPT algorithm for the general problem. For
restricted versions of this problem, such as when the relative order of buses
is predefined, or when a bus must be placed above all its points, we provide
efficient algorithms. We show that another restricted version of the problem
can be solved using 2-stack pushall sorting. On the negative side we prove the
NP-completeness of a special case of BEP.Comment: 19 pages, 9 figures, conference version at GD 201
A framework for models of movement in geographic space
This article concerns the theoretical foundations of movement informatics. We discuss general frameworks in which models of spatial movement may be developed. In particular, the article considers the object–field and Lagrangian–Eulerian dichotomies, and the SNAP/SPAN ontologies of the dynamic world, and classifies the variety of informatic structures according to these frameworks. A major challenge is transitioning between paradigms. Usually data is captured with respect to one paradigm but can usefully be represented in another. We discuss this process in formal terms and then describe experiments that we performed to show feasibility. It emerges that observational granularity plays a crucial role in these transitions
Optimizing the use of detector arrays for measuring intensity correlations of photon pairs
Finding turning-points in ultra-high-resolution animal movement data
1. Recent advances in biologging have resulted in animal location data at unprecedentedly high temporal resolutions, sometimes many times per second. However, many current methods for analysing animal movement (e.g. step selection analysis or state-space modelling) were developed with lower-resolution data in mind. To make such methods usable with high-resolution data, we require techniques to identify features within the trajectory where movement deviates from a straight line.
2. We propose that the intricacies of movement paths, and particularly turns, reflect decisions made by animals so that turn points are particularly relevant for behavioural ecologists. As such, we introduce a fast, accurate algorithm for inferring turning-points in high-resolution data. For analysing big data, speed and scalability are vitally important. We test our algorithm on simulated data, where varying amounts of noise were added to paths of straight-line segments interspersed with turns. We also demonstrate our algorithm on data of free-ranging oryx (Oryx leucoryx). We compare our algorithm to existing statistical techniques for break-point inference.
3. The algorithm scales linearly and can analyse several hundred-thousand data-points in a few seconds on a mid-range desktop computer. It identified turnpoints in simulated data with complete accuracy when the noise in the headings had a standard deviation of 8 degrees, well within the tolerance of many modern biologgers. It has comparable accuracy to the existing algorithms tested, and is up to three orders of magnitude faster.
4. Our algorithm, freely available in R and Python, serves as an initial step in processing ultra high-resolution animal movement data, resulting in a rarefied path that can be used as an input into many existing step-and-turn methods of analysis. The resulting path consists of points where the animal makes a clear turn, and thereby provides valuable data on decisions underlying movement patterns. As such, it provides an important breakthrough required as a starting point for analysing sub-second resolution data
Small grid embeddings of 3-polytopes
We introduce an algorithm that embeds a given 3-connected planar graph as a
convex 3-polytope with integer coordinates. The size of the coordinates is
bounded by . If the graph contains a triangle we can
bound the integer coordinates by . If the graph contains a
quadrilateral we can bound the integer coordinates by . The
crucial part of the algorithm is to find a convex plane embedding whose edges
can be weighted such that the sum of the weighted edges, seen as vectors,
cancel at every point. It is well known that this can be guaranteed for the
interior vertices by applying a technique of Tutte. We show how to extend
Tutte's ideas to construct a plane embedding where the weighted vector sums
cancel also on the vertices of the boundary face
Almost optimal asynchronous rendezvous in infinite multidimensional grids
Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in an infinite grid of dimension δ> 0, starting from two arbitrary positions at distance at most d. Since the problem is clearly infeasible in such general setting, we assume that the grid is embedded in a δ-dimensional Euclidean space and that each agent knows the Cartesian coordinates of its own initial position (but not the one of the other agent). We design an algorithm permitting the agents to meet after traversing a trajectory of length O(d δ polylog d). This bound for the case of 2d-grids subsumes the main result of [12]. The algorithm is almost optimal, since the Ω(d δ) lower bound is straightforward. Further, we apply our rendezvous method to the following network design problem. The ports of the δ-dimensional grid have to be set such that two anonymous agents starting at distance at most d from each other will always meet, moving in an asynchronous manner, after traversing a O(d δ polylog d) length trajectory. We can also apply our method to a version of the geometric rendezvous problem. Two anonymous agents move asynchronously in the δ-dimensional Euclidean space. The agents have the radii of visibility of r1 and r2, respectively. Each agent knows only its own initial position and its own radius of visibility. The agents meet when one agent is visible to the other one. We propose an algorithm designing the trajectory of each agent, so that they always meet after traveling a total distance of O( ( d)), where r = min(r1, r2) and for r ≥ 1. r)δpolylog ( d r
- …