This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually calculating centrality indices.Expand

This work presents the first constant-factor approximation algorithm for the minimum-weight dominating set problem in unit disk graphs, a problem motivated by applications in wireless ad-hoc networks.Expand

These are the first known PTASs for $\mathcal{NP}$-hard optimization problems on disk graphs based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible.Expand

This work demonstrates that the use of multipath routing offers significant advantages in bandwidth provisioning for VPNs and presents an optimal polynomial-time algorithm that computes a bandwidth reservation of minimum cost using multi-path routing.Expand

These are the first known polynomial-time approximation schemes for NP-hard optimization problems on disk graphs based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible.Expand

It is shown that in graphs with unit-capacities and general edge lengths it is <i>NP</i>-complete to decide whether there is a fractional length-bounded flow of a given value.Expand

This study uses the well-known (unit) disk model for wireless networks and shows that Unique Coverage remains NP-hard in this case and presents a polynomial-time 1/18-approximation algorithm for the minimum membership set cover problem.Expand

A proof that FIFO is a 2-competitive online algorithm for minimizing the maximum response time and that there is no better deterministic online algorithm are given.Expand