An O(1)-Approximation for Minimum Spanning Tree Interdiction

Network interdiction problems are a natural way to study the sensitivity of a network optimization problem with respect to the removal of a limited set of edges or vertices. One of the oldest and best-studied interdiction problems is minimum spanning tree (MST) interdiction. Here, an undirected multigraph with nonnegative edge weights and positive interdiction costs on its edges is given, together with a positive budget B. The goal is to find a subset of edges R, whose total interdiction cost does not exceed B, such that removing R leads to a graph where the weight of an MST is as large as possible. Frederickson and Solis-Oba (SODA 1996) presented an O(log m)-approximation for MST interdiction, where m is the number of edges. Since then, no further progress has been made regarding approximations, and the question whether MST interdiction admits an O(1)-approximation remained open. We answer this question in the affirmative, by presenting a 14-approximation that overcomes two main hurdles that hindered further progress so far. Moreover, based on a well-known 2-approximation for the metric traveling salesman problem (TSP), we show that our O(1)-approximation for MST interdiction implies an O(1)-approximation for a natural interdiction version of metric TSP

Algorithms to prevent attacks in active directory environments

Microsoft Active Directory is the default management system for Windows domain networks, so convenient that it is used in many organizations worldwide. Because of this popularity, AD has been a focused cyberattack target. An Active Directory environment could be described as an attack graph in which nodes represent users, computers, groups, and services. The problem is formulated with an attacker who has managed to infiltrate the network to a certain number of nodes (entry nodes) and seeks to reach the most privileged node. On the other hand, the defender's objective will be to maximize the attacker's shortest path length. In this paper, we have conducted a study of the AD-blocking style graph. We have observed that the attack graphs of this Microsoft service have small maximum attack path lengths and are tree-like. The problem is computationally difficult. Six different algorithms have been formulated to solve the problem. Firstly, the problem of blocking only the most vital edge of the attack graph has been investigated, where two algorithms have been formulated and will later become greedy algorithms. An FPT algorithm and three heuristic algorithms have also been developed: a Hill Climbing, a Simulated Annealing, and a genetic algorithm. With these algorithms, we will help IT admins identify high-risk edges in practical Active Directory environments

Graph measures and network robustness

Network robustness research aims at finding a measure to quantify network robustness. Once such a measure has been established, we will be able to compare networks, to improve existing networks and to design new networks that are able to continue to perform well when it is subject to failures or attacks. In this paper we survey a large amount of robustness measures on simple, undirected and unweighted graphs, in order to offer a tool for network administrators to evaluate and improve the robustness of their network. The measures discussed in this paper are based on the concepts of connectivity (including reliability polynomials), distance, betweenness and clustering. Some other measures are notions from spectral graph theory, more precisely, they are functions of the Laplacian eigenvalues. In addition to surveying these graph measures, the paper also contains a discussion of their functionality as a measure for topological network robustness

A highly efficient measure of mass segregation in star clusters

Investigations of mass segregation are of vital interest for the understanding of the formation and dynamical evolution of stellar systems on a wide range of spatial scales. Our method is based on the minimum spanning tree (MST) that serves as a geometry-independent measure of concentration. Compared to previous such approaches we obtain a significant refinement by using the geometrical mean as an intermediate-pass. It allows the detection of mass segregation with much higher confidence and for much lower degrees of mass segregation than other approaches. The method shows in particular very clear signatures even when applied to small subsets of the entire population. We confirm with high significance strong mass segregation of the five most massive stars in the Orion Nebula Cluster (ONC). Our method is the most sensitive general measure of mass segregation so far and provides robust results for both data from simulations and observations. As such it is ideally suited for tracking mass segregation in young star clusters and to investigate the long standing paradigm of primordial mass segregation by comparison of simulations and observations.Comment: 11 pages, 9 figures, accepted by A&

Algebraic Methods in the Congested Clique

In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2/\omega})$ round matrix multiplication algorithm, where $\omega < 2.3728639$ is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: -- triangle and 4-cycle counting in $O(n^{0.158})$ rounds, improving upon the $O(n^{1/3})$ triangle detection algorithm of Dolev et al. [DISC 2012], -- a $(1 + o(1))$-approximation of all-pairs shortest paths in $O(n^{0.158})$ rounds, improving upon the $\tilde{O} (n^{1/2})$-round $(2 + o(1))$-approximation algorithm of Nanongkai [STOC 2014], and -- computing the girth in $O(n^{0.158})$ rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.Comment: This is work is a merger of arxiv:1412.2109 and arxiv:1412.266