On selecting a fraction of leaves with disjoint neighborhoods in a plane tree

We present a generalization of a combinatorial result by Aggarwal et al. (1989) on a linear-time algorithm that selects a constant fraction of leaves, with pairwise disjoint neighborhoods, from a binary tree embedded in the plane. This result of Aggarwal et al. (1989) is essential to the linear-time...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 319; pp. 141 - 148
Main Authors:	Junginger, Kolja, Mantas, Ioannis, Papadopoulou, Evanthia
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.10.2022
Subjects:	Binary tree Constant fraction of leaves Linear-time algorithm Voronoi diagram Voronoi diagram Binary tree Constant fraction of leaves Linear-time algorithm
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!