- Heuristics for the K-Cardinality Tree and Subgraph Problems (1996)
- In this paper we consider the problem of finding in a given graph a minimal weight subtree of connected subgraph, which has a given number of edges. These NP-hard combinatorial optimization problems have various applications in the oil industry, in facility layout and graph partitioning. We will present different heuristic approaches based on spanning tree and shortest path methods and on an exact algorithm solving the problem in polynomial time if the underlying graph is a tree. Both the edge- and node weighted case are investigated and extensive numerical results on the behaviour of the heuristics compared to optimal solutions are presented. The best heuristic yielded results within an error margin of less than one percent from optimality for most cases. In a large percentage of tests even optimal solutions have been found.
- Anisotropy analysis of pressed point processes (2008)
- This paper introduces methods for the detection of anisotropies which are caused by compression of regular three-dimensional point patterns. Isotropy tests based on directional summary statistics and estimators for the compression factor are developed. These allow not only for the detection of anisotropies but also for the estimation of their strength. Using simulated data the power of the methods and the dependence of the power on the intensity, the degree of regularity, and the compression strength are studied. The motivation of this paper is the investigation of anisotropies in the structure of polar ice. Therefore, our methods are applied to the point patterns of centres of air pores extracted from tomographic images of ice cores. This way the presence of anisotropies in the ice caused by the compression of the ice sheet as well as an increase of their strength with increasing depth are shown.