C. Ras

activity

20172024

most citedUnsupervised Basis Function Adaptation for Reinforcement Learning

4 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

The $2$ -connected bottleneck Steiner network problem is NP-hard in any $ℓ_{p}$ plane

M Brazil, C Ras, D Thomas +1

Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most $k$ Steiner points s…

cs.CG2019

Degree Bounded Bottleneck Spanning Trees in Three Dimensions

Patrick J. Andersen, Charl J. Ras

The geometric $δ$ -minimum spanning tree problem ( $δ$ -MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the…

The 2-connected bottleneck Steiner network problem is NP-hard in any ℓp​ plane

Degree Bounded Bottleneck Spanning Trees in Three Dimensions

The $2$ -connected bottleneck Steiner network problem is NP-hard in any $ℓ_{p}$ plane