A. K. Abu-Affash

activity

20102022

collaborators

3 papers

cs.DS2020

A Linear-Time Algorithm for Minimum $k$ -Hop Dominating Set of a Cactus Graph

A. Karim Abu-Affash, Paz Carmi, Adi Krasin

Given a graph $G = (V, E)$ and an integer $k \geq 1$ , a $k$ -hop dominating set $D$ of $G$ is a subset of $V$ , such that, for every vertex $v \in V$ , there exists a node $u \in D$ whose…

cs.CG2020

Planar Bichromatic Bottleneck Spanning Trees

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi +1

Given a set $P$ of $n$ red and blue points in the plane, a \emph{planar bichromatic spanning tree} of $P$ is a spanning tree of $P$ , such that each edge connects between a red and…

cs.CG2010

An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem

A. Karim Abu-Affash

Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) poin…

A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph

Planar Bichromatic Bottleneck Spanning Trees

An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem

A Linear-Time Algorithm for Minimum $k$ -Hop Dominating Set of a Cactus Graph