# Search results for: Mohammadreza Razzazi

Theory of Computing Systems > 2018 > 62 > 8 > 2035-2047

*P*be a set of points in the plane. The goal is to place two unit disks in the plane such that the number of points from

*P*covered by the disks is maximized. In addition, the distance between the centers of the two disks should not exceed a specified constant

*R*

_{c}≥ 0. We propose two algorithms to solve this problem. The first algorithm is a simple exhaustive algorithm which runs in

*O*(

*n*

^{4}) time. We...

Journal of Intelligent Manufacturing > 2019 > 30 > 5 > 2273-2289

Journal of Computer and System Sciences > 2017 > 85 > C > 74-92

Information Processing Letters > 2016 > 116 > 9 > 590-594

Journal of Combinatorial Optimization > 2017 > 33 > 3 > 1030-1056

*G*and

*p*pairs of vertices $$P=\left\{ {\left( {s_1 ,t_1 } \right) ,\ldots ,\left( {s_p ,t_p } \right) } \right\} $$ P = s 1 , t 1 , … , s p , t p , one has to find the minimum weight set of arcs (edges) to be added to the graph so that the resulting graph...

Lecture Notes in Computer Science > Computational Science — ICCS 2001 > Computational Geometry and Applications > 763-771

*mot*, presents a quadratic time algorithm for reaching a point inside the region by the end of the linkage. It is shown that the algorithm works when a certain condition is satisfied.

Theoretical Computer Science > 2014 > 527 > Complete > 50-60

Information Sciences > 2014 > 262 > Complete > 190-214

Theory of Computing Systems > 2012 > 50 > 3 > 545-558

*n*points in

*R*

^{2},

*r*>0, and an integer

*m*>0 are given and the goal is to cover the maximum number of points with

*m*disks with radius

*r*. The dual of the most points covering problem is the partial covering problem in which

*n*points in

*R*

^{2}are given, and we try...

Information Sciences > 2011 > 181 > 17 > 3581-3600

Discrete Applied Mathematics > 2011 > 159 > 14 > 1418-1424

Computers & Industrial Engineering > 2011 > 60 > 2 > 349-360