scientific article; zbMATH DE number 7236412
From MaRDI portal
Publication:5115775
DOI10.4230/LIPIcs.SoCG.2018.8zbMath1489.68339MaRDI QIDQ5115775
J. Ian Munro, Prosenjit Bose, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid
Publication date: 18 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Algorithms for the line-constrained disk coverage and related problems ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ Range assignment of base-stations maximizing coverage area without interference ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Connecting a set of circles with minimum sum of radii
- Range assignment of base-stations maximizing coverage area without interference
- The minimum-area spanning tree problem
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Algorithms – ESA 2005
This page was built for publication:
