Minmax Tree Cover in the Euclidean Space

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minmax Tree Cover in the Euclidean Space

Let G = (V,E) be an edge-weighted graph, and let w(H) denote the sum of the weights of the edges in a subgraph H of G. Given a positive integer k, the balanced tree partitioning problem requires to cover all vertices in V by a set T of k trees of the graph so that the ratio α of maxT∈T w(T ) to w(T ∗)/k is minimized, where T ∗ denotes a minimum spanning tree of G. The problem has been used as a...

متن کامل

Approximating the minmax rooted-tree cover in a tree

Given an edge-weighted rooted tree T and a positive integer p ( n), where n is the number of vertices in T , we cover all vertices in T by a set of p subtrees each of which contains the root r of T . The minmax rooted-tree cover problem asks to find such a set of p subtrees so as to minimize the maximum weight of the subtrees in the set. In this paper, we propose an O(n) time (2 + ε)-approximat...

متن کامل

On the Quaternionic Curves in the Semi-Euclidean Space E_4_2

In this study, we investigate the semi-real quaternionic curves in the semi-Euclidean space E_4_2. Firstly, we introduce algebraic properties of semi-real quaternions. Then, we give some characterizations of semi-real quaternionic involute-evolute curves in the semi-Euclidean space E42 . Finally, we give an example illustrated with Mathematica Programme.

متن کامل

Steiner Tree Heuristics in Euclidean d-Space

We present a class of heuristics for the Euclidean Steiner tree problem in a d-dimensional space, d ≥ 3. These heuristics identify small subsets with few, geometrically close, terminals using Delaunay tessellations and minimum spanning trees. Low cost spanning trees of these subsets are determined by applying the exact algorithm for the Euclidean Steiner minimal tree in d-space as well as its h...

متن کامل

Characterizations of Slant Ruled Surfaces in the Euclidean 3-space

In this study, we give the relationships between the conical curvatures of ruled surfaces generated by the unit vectors of the ruling, central normal and central tangent of a ruled surface in the Euclidean 3-space E^3. We obtain differential equations characterizing slant ruled surfaces and if the reference ruled surface is a slant ruled surface, we give the conditions for the surfaces generate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Algorithms and Applications

سال: 2011

ISSN: 1526-1719

DOI: 10.7155/jgaa.00230