Euclidean movement minimization

DOI10.1007/s10878-015-9842-5zbMath1353.90125OpenAlexW1980674078MaRDI QIDQ306076

Nima Anari, Mohammad Ghodsi, Mohammad Ali Safari, Mohammad Amin Fazli

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 algorithmsNP-hardnessmovement minimization

Mathematics Subject Classification ID

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

Related Items (2)

The capacitated mobile facility location problem ⋮ Network movement games

Cites Work

• Unnamed Item
• Minimizing movement
• O(1)-Approximations for Maximum Movement Problems
• Minimizing Movement: Fixed-Parameter Tractability
• Universality considerations in VLSI circuits
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Hamilton Paths in Grid Graphs

This page was built for publication: Euclidean movement minimization