Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Article
- DOI: 10.1007/s10878-015-9842-5
- Publisher: Springer New York LLC
- Abstract:
- We consider a class of optimization problems called movement minimization on euclidean plane. Given a set of m nodes on the plane, the aim is to achieve some specific property by minimum movement of the nodes. We consider two specific properties, namely the connectivity (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 extend some known result on graphical grounds and obtain inapproximability results on the geometrical grounds. For the Topol problems (where the final decoration of the nodes must correspond to a given configuration), we find it much simpler and provide FPTAS for both Max and Sum versions
- Keywords:
- Movement minimization ; Geometry ; Hardness ; Optimization ; Euclidean ; Euclidean planes ; Hardness result ; Inapproximability ; NP-hardness ; Optimization problems ; Specific properties ; Approximation algorithms
- Source: Journal of Combinatorial Optimization ; Volume 32, Issue 2 , 2016 , Pages 354-367 ; 13826905 (ISSN)
- URL: https://link.springer.com/article/10.1007/s10878-015-9842-5