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

DOI10.1016/J.DAM.2019.04.028MaRDI QIDQ2201771zbMATH OpenOpenAlexWikidataFDO

Authors Sandip Das, Ayan Nandy, 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)

Recommendations

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

Cites work

• Minimizing movement
• Minimizing movement in mobile facility location problems
• Minimizing movement: fixed-parameter tractability

Cited in

(2)

• Optimizing movement in convex and non-convex path-networks to establish connectivity
• Estimating the free region of a sensor node

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

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