Minimizing the Maximum Moving Cost of Interval Coverage

DOI10.1142/S0218195917500030zbMath1423.68550OpenAlexW2790695573MaRDI QIDQ5894681

Victor C. S. Lee, Xiao Zhang, Haitao Wang

Publication date: 31 January 2018

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195917500030

zbMATH Keywords

interval coverageweighted distancebarrier coverage

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Algorithms for covering multiple barriers

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Minimizing the aggregate movements for interval coverage
• Average case network lifetime on an interval with adjustable sensing ranges
• Maximizing Barrier Coverage Lifetime with Mobile Sensors
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• An Optimal-Time Algorithm for Slope Selection