Euclidean movement minimization
From MaRDI portal
Publication:306076
DOI10.1007/S10878-015-9842-5zbMATH Open1353.90125OpenAlexW1980674078MaRDI QIDQ306076FDOQ306076
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
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Hamilton Paths in Grid Graphs
- Minimizing movement
- \(O(1)\)-approximations for maximum movement problems
- Cascading behavior in networks: algorithmic and economic issues
- Minimizing Movement: Fixed-Parameter Tractability
- Universality considerations in VLSI circuits
Cited In (10)
- Minimizing movement
- The capacitated mobile facility location problem
- Optimizing movement in convex and non-convex path-networks to establish connectivity
- Exact and approximate algorithms for movement problems on (special classes of) graphs
- The deep minimizing movement scheme
- \(O(1)\)-approximations for maximum movement problems
- FPTAS for Minimizing Earth Mover’s Distance under Rigid Transformations
- Network movement games
- Optimizing movement in convex and non-convex path-networks to establish connectivity
- Minimizing movement
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)
