Euclidean movement minimization

DOI10.1007/S10878-015-9842-5MaRDI QIDQ306076zbMATH OpenOpenAlexFDO

Authors Nima Anari, Mohammad Ghodsi, MohammadAmin Fazli, MohammadAli Safari

Publication date 31 August 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-015-9842-5

zbMATH Keywords

approximation algorithmsmovement minimizationNP-hardness

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Minimizing movement
• Minimizing movement
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Optimizing movement in convex and non-convex path-networks to establish connectivity

Cites work

• O(1)-approximations for maximum movement problems
• Cascading behavior in networks: algorithmic and economic issues
• Hamilton Paths in Grid Graphs
• Minimizing movement
• Minimizing Movement: Fixed-Parameter Tractability
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Universality considerations in VLSI circuits

Cited in

(10)

• The capacitated mobile facility location problem
• Optimizing movement in convex and non-convex path-networks to establish connectivity
• FPTAS for Minimizing Earth Mover’s Distance under Rigid Transformations
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Minimizing movement
• Minimizing movement
• Optimizing movement in convex and non-convex path-networks to establish connectivity
• O(1)-approximations for maximum movement problems
• Network movement games
• The deep minimizing movement scheme

This page was built for publication: Euclidean movement minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306076)