Optimizing movement in convex and non-convex path-networks to establish connectivity

DOI10.1016/j.dam.2019.04.028zbMath1453.68204OpenAlexW2948439477WikidataQ127792122 ScholiaQ127792122MaRDI QIDQ2201771

Ayan Nandy, Sandip Das, Swami Sarvottamananda

Publication date: 17 September 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.04.028

zbMATH Keywords

computational geometrygeometric optimizationbarrier coveragemin-max movement

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Connectivity (05C40)

Cites Work

• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Minimizing movement
• Minimizing movement in mobile facility location problems
• Minimizing Movement: Fixed-Parameter Tractability

This page was built for publication: Optimizing movement in convex and non-convex path-networks to establish connectivity