STEINER POINTS FOR CONVEX POLYTOPES CHRISTIAN BERG Let & denote the set of all convex polytopes, degenerate or not, in ^-dimensional Euclidean space E. An abstract Steiner point for convex polytopes in E is a mapping S:2P-+E satisfying S(P+Q) = S(P) + S(Q) for all P, Qe0*, (1) addition on the left being Minkowski addition of convex sets, and S{a(P)) = o{S(P)) (2) for all Pe&* and all similarity...

The total Steiner k-distance and the k-th total path length are the sum of the size of Steiner trees and ancestor-trees over sets of k nodes of a given tree, respectively. They are useful statistics with many applications. Consequently, they have been analyzed for many different random trees, including increasing tree, binary search tree, generalized m-ary search tree and simply generated trees...

Philosophers and legal theorists still disagree about the correct analysis of ‘rights’, both moral and legal. The ‘Will Theory’ and the ‘Interest Theory’—the two main views—can each account for various features of rights, but neither of them is totally satisfactory. The controversy has now been running for decades and seems irresolvable. I will contend in this paper that the discussion of ‘valu...

For a connected graph G, a set of vertices W in G is called a Steiner dominating set if W is both a Steiner set and a dominating set. The minimum cardinality of a Steiner dominating set of G is its Steiner domination numberand is denoted by ) (G s  . In this paper, it is studied that how the Steiner domination number is affected by adding a single edge to paths, complete graphs, cycles, star a...

Given a weighted graph G = (V,E) and a subset R of V , a Steiner tree in G is a tree which spans all vertices in R. The vertices in V \R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full Steiner tree problem is to find a full Steiner tree with minimum weight. The bottleneck full Steiner tree problem is to find a full Steiner tree wh...

Time-resolved spectroscopy of the novalike variable UU Aquarii is analyzed with eclipse mapping techniques to produce spatially resolved spectra of its accretion disc and gas stream as a function of distance from disc centre in the range 3600-6900 Å. The spatially-resolved spectra show that the continuum emission becomes progressively fainter and redder for increasing disc radius – reflecting t...

We establish a new symmetrization procedure for the isoperimetric problem in symmetric spaces of noncompact type. This symmetrization generalizes the well known Steiner symmetrization in euclidean space. In contrast to the classical construction the symmetrized domain is obtained by solving a nonlinear elliptic equation of mean curvature type. We conclude the paper discussing possible applicati...

Researchers have increasingly recognized the importance of applicant perceptions during the selection process and have investigated fairness perceptions related to applicant selection systems in particular (e.g., Ryan & Ployhart, 2000; Rynes, 1993; Steiner & Gilliland, 1996). Applicant screening is the first stage of a selection process, and applicant screening systems refer to procedures organ...

Proving that a function satisfies the quadrangle inequality is a powerful and elegant way to show that a dynamic programming algorithm to compute that function can be sped up by a factor of the input size. In this paper we consider two problems that do no fit in the usual general cases of functions that satisfy the quadrangle inequality but for which the proof of the quadrangle inequality still...