Range assignment of base-stations maximizing coverage area without interference

[PDF] arxiv.org

Parameterized Geometric Graph Modification with Disk Scaling

FV Fomin, PA Golovach, T Inamdar, S Saurabh… - arXiv preprint arXiv …, 2024 - arxiv.org
The parameterized analysis of graph modification problems represents the most extensively
studied area within Parameterized Complexity. Given a graph $ G $ and an integer …
相关文章 所有 2 个版本
[PDF] arxiv.org

Faster algorithms for some optimization problems on collinear points

A Biniaz, P Bose, P Carmi, A Maheshwari… - arXiv preprint arXiv …, 2018 - arxiv.org
We propose faster algorithms for the following three optimization problems on $ n $ collinear
points, ie, points in dimension one. The first two problems are known to be NP-hard in higher …
被引用次数：9 相关文章 所有 18 个版本
[PDF] arxiv.org

Maximizing the sum of radii of disjoint balls or disks

D Eppstein - arXiv preprint arXiv:1607.02184, 2016 - arxiv.org
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of
radii of the balls, can be expressed as a linear program. Its dual linear program expresses …
被引用次数：4 相关文章 所有 9 个版本