arXiv subjects

Till Fluschnik

Publications and source records attributed to Till Fluschnik.

42 records · Page 3Linked to original sources

arXiv2017

The Complexity of Routing with Few Collisions

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is whether one can connect the terminals by at least $p$ routes (e.g. paths) such that at most $k$ edges are time-wise shared among them. We study three types of routes: traverse each vertex at most once (paths), each edge at most once (trails), or no such restrictions (walks). We prove that for paths and trails the problem is NP-complete on undirected and directed graphs even if $k$ is constant or the maximum vertex degree in the input graph is constant. For walks, however, it is solvable in polynomial time on undirected graphs for arbitrary $k$ and on directed graphs if $k$ is constant. We additionally study for all route types a variant of the problem where the maximum length of a route is restricted by some given upper bound. We prove that this length-restricted variant has the same complexity classification with respect to paths and trails, but for walks it becomes NP-complete on undirected graphs.

cs.CC↗

arXiv2017

When can Graph Hyperbolicity be computed in Linear Time?

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms for computing the hyperbolicity number of a graph (the smaller, the more tree-like) have running time $O(n^4)$, where $n$ is the number of graph vertices. Exploiting the framework of parameterized complexity analysis, we explore possibilities for "linear-time FPT" algorithms to compute hyperbolicity. For instance, we show that hyperbolicity can be computed in time $O(2^{O(k)} + n +m)$ ($m$ being the number of graph edges) while at the same time, unless the SETH fails, there is no $2^{o(k)}n^2$-time algorithm.

cs.CC↗

arXiv2016

The Parameterized Complexity of the Minimum Shared Edges Problem

We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at most k edges. Herein, an edge is shared if it appears in at least two paths. We show that MSE is W[1]-hard when parameterized by the treewidth of the input graph and the number k of shared edges combined. We show that MSE is fixed-parameter tractable with respect to p, but does not admit a polynomial-size kernel (unless NP is contained in coNP/poly). In the proof of the fixed-parameter tractability of MSE parameterized by p, we employ the treewidth reduction technique due to Marx, O'Sullivan, and Razgon [ACM TALG 2013].

cs.CC↗

arXiv2016

The Minimum Shared Edges Problem on Planar Graphs

We study the Minimum Shared Edges problem introduced by Omran et al. [Journal of Combinatorial Optimization, 2015] on planar graphs: Planar MSE asks, given a planar graph G = (V,E), two distinct vertices s,t in V , and two integers p, k, whether there are p s-t paths in G that share at most k edges, where an edges is called shared if it appears in at least two of the p s-t paths. We show that Planar MSE is NP-hard by reduction from Vertex Cover. We make use of a grid-like structure, where the alignment (horizontal/vertical) of the edges in the grid correspond to selection and validation gadgets respectively.

cs.CC↗

arXiv2016

Variance-based control of regime shifts: bistability and oscillations

A variety of real world and experimental systems can display a drastic regime shift, as the evolution in one its paramaters crosses a threshold value. Assimilation of such a transition with a bifurcation has allowed to identify so called "early warning signals", at the level of the time series generated by the system underscope. The literature in early warning detection methods is currently expanding and their potential for practical applicability is being discussed in different contexts. In this work, we elaborate on the use of the variance of a system variable, which constitutes the simplest early warning indicator, to gain control on the long-term dynamics of the system, while extending an exploitation phase. In particular, we address the cases of the cusp and Hopf normal forms, as prototypical examples of bistability and oscillations. Our results provide insights on the interplay between the time-scale for the system observation, the degree of sensitivity of the control feedback and the intensity of the random perturbations, in shaping the long-term control efficiency.

nlin.AO↗

arXiv2014

The size distribution, scaling properties and spatial organization of urban clusters: a global and regional perspective

Human development has far-reaching impacts on the surface of the globe. The transformation of natural land cover occurs in different forms and urban growth is one of the most eminent transformative processes. We analyze global land cover data and extract cities as defined by maximally connected urban clusters. The analysis of the city size distribution for all cities on the globe confirms Zipf's law. Moreover, by investigating the percolation properties of the clustering of urban areas we assess the closeness to criticality for various countries. At the critical thresholds, the urban land cover of the countries undergoes a transition from separated clusters to a gigantic component on the country scale. We study the Zipf-exponents as a function of the closeness to percolation and find a systematic decrease with increasing scale, which could be the reason for deviating exponents reported in literature. Moreover, we investigate the average size of the clusters as a function of the proximity to percolation and find country specific behavior. By relating the standard deviation and the average of cluster sizes -- analogous to Taylor's law -- we suggest an alternative way to identify the percolation transition. We calculate spatial correlations of the urban land cover and find long-range correlations. Finally, by relating the areas of cities with population figures we address the global aspect of the allometry of cities, finding an exponent $δ\approx 0.85$, i.e. large cities have lower densities.

physics.soc-ph↗