Maximizing Covered Area in a Euclidean Plane with Connectivity Constraint

Abstract: Given a set of unit disks in the plane and an integer K, the maximum area connected subset problem asks for a subset of K disks covering the maximum area, under the constraint that the area covered by the K disks is connected. This problem is motivated by wireless router deployment and is a special case of maximizing a submodular function under a connectivity constraint.

Date: Mar 20, 2019 at 14:30:00 h
Venue: Republica 701, Sala 33
Speaker: Mathieu Mari
Affiliation: École Normale Supérieurem, Francia
Coordinator: Profesores: Mario Bravo; José Verschae
Abstract:
PDF

Posted on Mar 18, 2019 in ACGO, Seminars