Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity

DOI10.1007/978-3-319-53007-9_13zbMath1453.68205OpenAlexW2585840363MaRDI QIDQ2971642

Ayan Nandy, Sandip Das, Swami Sarvottamananda

Publication date: 7 April 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_13

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