Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane

2016 ◽  
Vol 26 (03n04) ◽  
pp. 185-210
Author(s):  
Haitao Wang ◽  
Jingru Zhang
Keyword(s):  
Time Algorithm ◽  
Efficient Algorithms ◽  
Additional Constraint ◽  
Distance Measures ◽  
Np Hard ◽  
Center Problem ◽  
Median Problem ◽  
One Dimensional ◽  
The Given

The (weighted) [Formula: see text]-median, [Formula: see text]-means, and [Formula: see text]-center problems in the plane are known to be NP-hard. In this paper, we study these problems with an additional constraint that requires the sought [Formula: see text] facilities to be on a given line. We present efficient algorithms for various distance measures such as [Formula: see text]. We assume that all [Formula: see text] weighted points are given sorted by their projections on the given line. For [Formula: see text]-median, our algorithms for [Formula: see text] and [Formula: see text] metrics run in [Formula: see text] time and [Formula: see text] time, respectively. For [Formula: see text]-means, which is defined only on the squared [Formula: see text] distance, we give an [Formula: see text] time algorithm. For [Formula: see text]-center, our algorithms run in [Formula: see text] time for all three metrics, and in [Formula: see text] time for the unweighted version under [Formula: see text] and [Formula: see text] metrics. While our results for the [Formula: see text]-center problem are optimal, the results for the [Formula: see text]-median problem almost match the best algorithms for the corresponding one-dimensional problems.

ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS

1999 ◽  
Vol 09 (03) ◽  
pp. 219-233 ◽  
Author(s):  
MICHAEL SEGAL
Keyword(s):  
Dimensional Space ◽  
Time Algorithm ◽  
Efficient Algorithms ◽  
Center Problem ◽  
Running Time ◽  
Higher Dimensional ◽  
Axis Parallel ◽  
The Given ◽  
Existing Result

We consider the p-piercing problem for axis-parallel rectangles. We are given a collection of axis-parallel rectangles in the plane and wish to determine whether there exists a set of p points whose union intersects all the given rectangles. We present efficient algorithms for finding a piercing set (i.e, a set of p points as above) for values of p=1,2,3,4,5. The result for 4 and 5-piercing improves an existing result of O(n  log 3 n) and O(n  log 4 n) to O(n  log  n) time. The result for 5-piercing can be applied find an O(n  log 2 n) time algorithm for planar rectilinear 5-center problem, in which we are given a set S of n points in the pane, and wish to find 5 axis-parallel congruent squares of smallest possible size whose union covers S. We improve the existing algorithm for general (but fixed) p to O(np-4 log  n) running time, and we also extend our algorithms to higher dimensional space. We also consider the problem of piercing a set of rectangular rings.

scholarly journals An Efficient Algorithm of the Planar 3-Center Problem for a set of the convex position points

2018 ◽  
Vol 232 ◽  
pp. 03022
Author(s):  
Donglai Bian ◽  
Bo Jiang ◽  
Zhiying Cao
Keyword(s):  
Efficient Algorithm ◽  
Convex Polygon ◽  
Time Algorithm ◽  
Center Problem ◽  
Minimum Radius ◽  
Convex Position ◽  
The Given ◽  
Circular Disks

The planar 3-center problem for a set S of points given in the plane asks for three congruent circular disks with the minimum radius, whose union can cover all points of S completely. In this paper, we present an O(n2 log3n) time algorithm for a restricted planar 3-center problem in which the given points are in the convex positions , i.e. The given points are the vertices of a convex polygon exactly.

scholarly journals Efficient algorithms for the one-dimensional k-center problem

2015 ◽  
Vol 592 ◽  
pp. 135-142 ◽  
Author(s):  
Danny Z. Chen ◽  
Jian Li ◽  
Haitao Wang
Keyword(s):  
Efficient Algorithms ◽  
Center Problem ◽  
One Dimensional ◽  
The One

Learning Importance of Preferences

10.29007/v68w ◽  
2018 ◽  
Author(s):  
Ying Zhu ◽  
Mirek Truszczynski
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scoring Rules ◽  
Np Hard ◽  
Individual Preferences

We study the problem of learning the importance of preferences in preference profiles in two important cases: when individual preferences are aggregated by the ranked Pareto rule, and when they are aggregated by positional scoring rules. For the ranked Pareto rule, we provide a polynomial-time algorithm that finds a ranking of preferences such that the ranked profile correctly decides all the examples, whenever such a ranking exists. We also show that the problem to learn a ranking maximizing the number of correctly decided examples (also under the ranked Pareto rule) is NP-hard. We obtain similar results for the case of weighted profiles when positional scoring rules are used for aggregation.

scholarly journals BLOCK CIPHERS ON THE BASIS OF REVERSIBLE CELLULAR AUTOMATA

2020 ◽  
Vol 10 (1) ◽  
pp. 8-11
Author(s):  
Yuliya Tanasyuk ◽  
Petro Burdeinyi
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Key Generation ◽  
One Dimensional ◽  
C Programming Language ◽  
C Programming ◽  
Shared Secret ◽  
Reversible Cellular Automata ◽  
The Given ◽  
First Time

The given paper is devoted to the software development of block cipher based on reversible one-dimensional cellular automata and the study of its statistical properties. The software implementation of the proposed encryption algorithm is performed in C# programming language in Visual Studio 2017. The paper presents specially designed approach for key generation. To ensure desired cryptographic stability, the shared secret parameters can be adjusted to contain information needed for creating substitution tables, defining reversible rules, and hiding final data. For the first time, it is suggested to create substitution tables based on iterations of a cellular automaton that is initialized by the key data.

Dimensionality and Construct Validity of a Video-Based, Objective Personality Test for the Assessment of Willingness to Take Risks in Road Traffic

2005 ◽  
Vol 97 (1) ◽  
pp. 309-320 ◽  
Author(s):  
Martin E. Arendasy ◽  
Andreas Hergovich ◽  
Markus Sommer ◽  
Bettina Bognar
Keyword(s):  
Construct Validity ◽  
Personality Trait ◽  
Road Traffic ◽  
Personality Test ◽  
Traffic Situation ◽  
One Dimensional ◽  
First Results ◽  
The One ◽  
The Given ◽  
Homeostasis Theory

The study at hand reports first results about the dimensionality and construct validity of a newly developed objective, video-based personality test, which assesses the willingness to take risks in traffic situations. On the basis of the theory of risk homeostasis developed by Wilde, different traffic situations with varying amounts of objective danger were filmed. These situations mainly consisted of situations with passing maneuvers and speed choice or traffic situations at intersections. Each of these traffic situations describes an action which should be carried out. The videos of the traffic situations are presented twice. Before the first presentation, a short written explanation of the preceding traffic situation and a situation-contingent reaction is provided. The respondents are allowed to obtain an overview of the given situations during the first presentation of each traffic situation. During the second presentation the respondents are asked to indicate at which point the action that is contingent on the described situation will become too dangerous to carry out. Latencies for items were recorded as a measure for the magnitude of the person's subjectively accepted willingness to take risks in the sense of the risk homeostasis theory by Wilde. In a study with 243 people with different education and sex, the one-dimensionality of the test corresponding to the latency model by Scheiblechner was investigated. Analysis indicated that the new measure assesses a one-dimensional latent personality trait which can be interpreted as subjectively accepted amount of risk (target risk value). First indicators for the construct validity of the test are given by a significant correlation with the construct-related secondary scale, adventurousness of the Eysenck Personality Profiler with, at the same time, nonsignificant correlations to the two secondary scales, extroversion and emotional stability, that are not linked to the construct.

Integration of one-dimensional equations of motions

2020 ◽  
pp. 79-90
Author(s):  
Gleb L. Kotkin ◽  
Valeriy G. Serbo
Keyword(s):  
Potential Energy ◽  
Field Change ◽  
One Dimensional ◽  
System A ◽  
Small Correction ◽  
The Law ◽  
The One ◽  
The Given ◽  
Equations Of Motions

If the potential energy is independent of time, the energy of the system remains constant during the motion of a closed system. A system with one degree of freedom allows for the determination of the law of motion in quadrature. In this chapter, the authors consider motion of the particles in the one-dimensional fields. They discuss also how the law and the period of a particle moving in the potential field change due to adding to the given field a small correction.

scholarly journals Oriented Coloring on Recursively Defined Digraphs

Algorithms ◽  
2019 ◽  
Vol 12 (4) ◽  
pp. 87 ◽  
Author(s):  
Frank Gurski ◽  
Dominique Komander ◽  
Carolin Rehs
Keyword(s):  
Chromatic Number ◽  
Linear Time ◽  
Directed Graphs ◽  
Graph Isomorphism ◽  
Oriented Graph ◽  
Time Algorithm ◽  
Isomorphism Problem ◽  
Np Hard ◽  
Graph Isomorphism Problem ◽  
Acyclic Digraph

Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G = ( V , A ) is a partition of the vertex set V into k independent sets such that all the arcs linking two of these subsets have the same direction. The oriented chromatic number of an oriented graph G is the smallest k such that G allows an oriented k-coloring. Deciding whether an acyclic digraph allows an oriented 4-coloring is NP-hard. It follows that finding the chromatic number of an oriented graph is an NP-hard problem, too. This motivates to consider the problem on oriented co-graphs. After giving several characterizations for this graph class, we show a linear time algorithm which computes an optimal oriented coloring for an oriented co-graph. We further prove how the oriented chromatic number can be computed for the disjoint union and order composition from the oriented chromatic number of the involved oriented co-graphs. It turns out that within oriented co-graphs the oriented chromatic number is equal to the length of a longest oriented path plus one. We also show that the graph isomorphism problem on oriented co-graphs can be solved in linear time.

Sign in / Sign up

Export Citation Format

Share Document