scholarly journals On the complexity of some partition problems of a finite set of points in Euclidean space into balanced clusters

2019 ◽  
Vol 488 (1) ◽  
pp. 16-20
Author(s):  
A. V. Kel’manov ◽  
A. V. Pyatkin ◽  
V. I. Khandeev
Keyword(s):  
Euclidean Space ◽  
Cluster Size ◽  
Np Completeness ◽  
Finite Set ◽  
Set Of Points

We consider some problems of partitioning a finite set of N points in d-dimension Euclidean space into two clusters balancing the value of (1) the quadratic variance normalized by a cluster size, (2) the quadratic variance, and (3) the size-weighted quadratic variance. We have proved the NP-completeness of all these problems.

NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters

2019 ◽  
Vol 100 (2) ◽  
pp. 416-419
Author(s):  
A. V. Kel’manov ◽  
A. V. Pyatkin ◽  
V. I. Khandeev
Keyword(s):  
Euclidean Space ◽  
Np Completeness ◽  
Finite Set ◽  
Set Of Points

ON THE STEINER RATIO IN $\mathcal{R}_{n}$

2011 ◽  
Vol 03 (04) ◽  
pp. 473-489
Author(s):  
HAI DU ◽  
WEILI WU ◽  
ZAIXIN LU ◽  
YINFENG XU
Keyword(s):  
Euclidean Space ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dimensional Euclidean Space ◽  
Minimum Length ◽  
Steiner Ratio ◽  
Line Segments ◽  
Finite Set ◽  
Steiner Minimum Tree ◽  
Set Of Points

The Steiner minimum tree and the minimum spanning tree are two important problems in combinatorial optimization. Let P denote a finite set of points, called terminals, in the Euclidean space. A Steiner minimum tree of P, denoted by SMT(P), is a network with minimum length to interconnect all terminals, and a minimum spanning tree of P, denoted by MST(P), is also a minimum network interconnecting all the points in P, however, subject to the constraint that all the line segments in it have to terminate at terminals. Therefore, SMT(P) may contain points not in P, but MST(P) cannot contain such kind of points. Let [Formula: see text] denote the n-dimensional Euclidean space. The Steiner ratio in [Formula: see text] is defined to be [Formula: see text], where Ls(P) and Lm(P), respectively, denote lengths of a Steiner minimum tree and a minimum spanning tree of P. The best previously known lower bound for [Formula: see text] in the literature is 0.615. In this paper, we show that [Formula: see text] for any n ≥ 2.

Cell Complexes, Valuations, and the Euler Relation

1970 ◽  
Vol 22 (2) ◽  
pp. 235-241 ◽  
Author(s):  
M. A. Perles ◽  
G. T. Sallee
Keyword(s):  
Euclidean Space ◽  
Hausdorff Metric ◽  
Dimensional Euclidean Space ◽  
Cell Complexes ◽  
Finite Dimensional ◽  
Finite Set ◽  
Euler Relation ◽  
Set Of Points ◽  
The Relationship ◽  
Dimensional Face

1. Recently a number of functions have been shown to satisfy relations on polytopes similar to the classic Euler relation. Much of this work has been done by Shephard, and an excellent summary of results of this type may be found in [11]. For such functions, only continuity (with respect to the Hausdorff metric) is required to assure that it is a valuation, and the relationship between these two concepts was explored in [8]. It is our aim in this paper to extend the results obtained there to illustrate the relationship between valuations and the Euler relation on cell complexes.To fix our notions, we will suppose that everything takes place in a given finite-dimensional Euclidean space X.A polytope is the convex hull of a finite set of points and will be referred to as a d-polytope if it has dimension d. Polytopes have faces of all dimensions from 0 to d – 1 and each of these is in turn a polytope. A k-dimensional face will be termed simply a k-face.

COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS

2004 ◽  
Vol 14 (01n02) ◽  
pp. 105-114 ◽  
Author(s):  
MICHAEL J. COLLINS
Keyword(s):  
Euclidean Space ◽  
Lower Bounds ◽  
Piecewise Linear ◽  
Upper And Lower Bounds ◽  
Linear Path ◽  
Change Direction ◽  
Finite Set ◽  
Minimum Number ◽  
Pass Through ◽  
Set Of Points

Given a finite set of points in Euclidean space, we can ask what is the minimum number of times a piecewise-linear path must change direction in order to pass through all of them. We prove some new upper and lower bounds for the rectilinear version of this problem in which all motion is orthogonal to the coordinate axes. We also consider the more general case of arbitrary directions.

scholarly journals Dk Gravitational Instantons as Superpositions of Atiyah–Hitchin and Taub–NUT Geometries

2021 ◽  
Author(s):  
B J Schroers ◽  
M A Singer
Keyword(s):  
Euclidean Space ◽  
Moduli Space ◽  
Gravitational Instantons ◽  
Fifth Dimension ◽  
Finite Set ◽  
Set Of Points

Abstract We obtain Dk ALF gravitational instantons by a gluing construction which captures, in a precise and explicit fashion, their interpretation as nonlinear superpositions of the moduli space of centred SU(2) monopoles, equipped with the Atiyah–Hitchin metric, and k copies of the Taub–NUT manifold. The construction proceeds from a finite set of points in euclidean space, reflection symmetric about the origin, and depends on an adiabatic parameter which is incorporated into the geometry as a fifth dimension. Using a formulation in terms of hyperKähler triples on manifolds with boundaries, we show that the constituent Atiyah–Hitchin and Taub–NUT geometries arise as boundary components of the five-dimensional geometry as the adiabatic parameter is taken to zero.

scholarly journals On extremums of sums of powered distances to a finite set of points

2012 ◽  
Vol 167 (1) ◽  
pp. 69-89 ◽  
Author(s):  
Nikolai Nikolov ◽  
Rafael Rafailov
Keyword(s):  
Finite Set ◽  
Set Of Points

scholarly journals A Helly-type theorem on a sphere

1967 ◽  
Vol 7 (3) ◽  
pp. 323-326 ◽  
Author(s):  
M. J. C. Baker
Keyword(s):  
Euclidean Space ◽  
Convex Sets ◽  
Type Theorem ◽  
Dimensional Euclidean Space ◽  
Dimensional Sphere ◽  
Strongly Convex ◽  
Set Of Points

The purpose of this paper is to prove that if n+3, or more, strongly convex sets on an n dimensional sphere are such that each intersection of n+2 of them is empty, then the intersection of some n+1 of them is empty. (The n dimensional sphere is understood to be the set of points in n+1 dimensional Euclidean space satisfying x21+x22+ …+x2n+1 = 1.)

Chebyshev polynomials on a finite set of points

1970 ◽  
Vol 6 (12) ◽  
pp. 1372-1374
Author(s):  
V. A. Bovin
Keyword(s):  
Chebyshev Polynomials ◽  
Finite Set ◽  
Set Of Points
Sign in / Sign up

Export Citation Format

Share Document