Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Article
- Publisher: 2011
- Abstract:
- We consider a class of optimization problems called movement minimization on euclidean plane. Given a set of nodes on the plane, the aim is to achieve some spe- cific property by minimum movement of the nodes. We consider two specific properties, namely the connectiv- ity (Con) and realization of a given topology (Topol). By minimum movement, we mean either the sum of all movements (Sum) or the maximum movement (Max). We obtain several approximation algorithms and some hardness results for these four problems. We obtain an O(m)-factor approximation for ConMax and ConSum and an O( p m=OPT)-factor approximation for Con- Max. We also extend some known result on graphical grounds in [1, 2] and obtain inapproximability results on the geometrical grounds. For the Topol problem (where the final decoration of the nodes must corre- spond to a given configuration), we find it much simpler and provide FPTAS for both Max and Sum versions
- Keywords:
- Euclidean ; Euclidean planes ; Hardness result ; Inapproximability ; Optimization problems ; Specific properties ; Approximation algorithms ; Computational geometry
- Source: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, 10 August 2011 through 12 August 2011 ; February , 2011
- URL: http://link.springer.com/article/10.1007/s10878-015-9842-5