Sharif Digital Repository

In this paper, we present a randomized LOCAL constant approximation factor algorithm for minimum dominating set (MDS) problem and minimum total dominating set (MTDS) problem in graphs. The approximation factor of this algorithm for planar graphs with no 4-cycles is 18 and 9 for MDS and MTDS problems, respectively. © 2020 Owner/Author  

For a set of n disjoint line segments S in R2, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from a query point p can be computed quickly. For this configuration, the visibility testing problem (VTP) is to test whether p sees a fixed segment s. These problems can be solved in logarithmic query time by using O(n4) preprocessing time and space. In this paper, we approximately solve this problem using quadratic preprocessing time and space. Our methods are superior to current approximation algorithms in terms of both approximation factor and preprocessing cost. In this paper, we propose a 2-approximation algorithm for the VCP using at... 

In real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. The assigned version of the k-center problem for n uncertain points in a metric space is studied in this paper. The main approach is to replace each uncertain point with a clever choice of a certain point. We argue that the k-center solution for these certain replacements of our uncertain points, is a good constant approximation factor for the original uncertain k-center problem. This approach enables us to present fast and simple algorithms that give... 

One of the most important applications of wireless sensor networks is data collection. This paper proposes as efficient approach for data collection in wireless sensor networks by introducing Member Forward List. This list includes the nodes with highest priority for forwarding the data. When a node fails or dies, this list is used to select the next node with higher priority. The benefit of this node is that it prevents the algorithm from repeating when a node fails or dies. The results show that Member Forward List decreases power consumption and latency in wireless sensor networks  

We prove an extended convexity for quantum Fisher information of a mixed state with a given convex decomposition. This convexity introduces a bound which has two parts: (i) The classical part associated with the Fisher information of the probability distribution of the states contributing to the decomposition, and (ii) the quantum part given by the average quantum Fisher information of the states in this decomposition. Next we use a non-Hermitian extension of a symmetric logarithmic derivative in order to obtain another upper bound on quantum Fisher information, which helps to derive a closed form for the bound in evolutions having the semigroup property. We enhance the extended convexity... 

Given a set S of n disjoint line segments in ℝ2, the visibility counting problem (VCP) is to preprocess S such that the number of segments in S visible from any query point p can be computed quickly. This problem can trivially be solved in logarithmic query time using O(n4) preprocessing time and space. Gudmundsson and Morin proposed a 2-approximation algorithm for this problem with a tradeoff between the space and the query time. They answer any query in Oε(n1−α) with Oε(n2+2α) of preprocessing time and space, where α is a constant 0 ≤ α ≤ 1, ε > 0 is another constant that can be made arbitrarily small, and Oε(f(n)) = O(f(n)nε). In this paper, we propose a randomized approximation algorithm... 

Given a set S of n disjoint line segments in R2, the visibility counting problem (VCP) is to preprocess S such that the number of segments in S visible from any query point p can be computed quickly. This problem can be solved trivially in O(log⁡n) query time using O(n4log⁡n) preprocessing time and O(n4) space. Gudmundsson and Morin (2010) [10] proposed a 2-approximation algorithm for this problem with a tradeoff between the space and the query time. For any constant 0≤α≤1, their algorithm answers any query in Oϵ(m(1−α)/2) time with Oϵ(m1+α) of preprocessing time and space, where ϵ>0 is a constant that can be made arbitrarily small and Oϵ(f(n))=O(f(n)nϵ) and m=O(n2) is a number that depends... 

We consider a one-parameter family of matrix-product states of spin-1 particles on a periodic chain and study in detail the entanglement properties of such a state. In particular, we calculate exactly the entanglement of one site with the rest of the chain, and the entanglement of two distant sites with each other, and show that the derivative of both these properties diverge when the parameter g of the states passes through a critical point. Such a point can be called a point of quantum phase transition, since at this point the character of the matrix-product state, which is the ground state of a Hamiltonian, changes discontinuously. We also study the finite size effects and show how the... 

We use the matrix product formalism to find exact ground states of two new spin-1 quantum chains with nearest neighbor interactions. One of the models, model I, describes a one-parameter family of quantum chains for which the ground state can be found exactly. In certain limit of the parameter, the Hamiltonian turns into the interesting case H=∑ i (S i· S i+1) 2. The other model which we label as model II, corresponds to a family of solvable three-state vertex models on square lattices. The ground state of this model is highly degenerate and the matrix product states is a generating state of such degenerate states. The simple structure of the matrix product state allows us to determine the... 

Using the matrix product formalism, we find exact ground states for two new spin-(1/2) and spin-(3/2) quantum chains. On a lattice of 3N sites, these ground states have a total spin of N/2, and hence have ferrimagnetic character. The novel point of this construction is that we construct a matrix product representation, not for a state which is invariant under rotation as has been hitherto considered, but for a state which transforms to other states under this symmetry operation. The method can be directly generalized to other symmetry groups. © Europhysics Letters Association