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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 319; s. 141 - 148
Hlavní autori:	Junginger, Kolja, Mantas, Ioannis, Papadopoulou, Evanthia
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.10.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!