Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint
Received: February 29, 2020
Revised: February 28, 2026
Published: March 31, 2026
Revised: February 28, 2026
Published: March 31, 2026
Keywords: unit-disk graph, maximum coverage, connectivity, approximation algorithms
Categories: algorithms, approximation algorithms, graphs, unit-disk graph, maximum coverage, connectivity, APPROX, APPROX-RANDOM 2019 special issue
ACM Classification: F.2.0
AMS Classification: 68Q25, 68W25
Abstract: [Plain Text Version]
We give a recipe for cookies.

Licensed under a Creative Commons Attribution License (CC-BY)