C. Ras

activity

20172020

most citedUnsupervised Basis Function Adaptation for Reinforcement Learning

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

collaborators

Showing math.COShow 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…

math.CO2018

Algorithms for Euclidean Degree Bounded Spanning Tree Problems

Patrick J. Andersen, Charl J. Ras

Given a set of points in the Euclidean plane, the Euclidean \textit{ $δ$ -minimum spanning tree} ( $δ$ -MST) problem is the problem of finding a spanning tree with maximum degree no mo…

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

Algorithms for Euclidean Degree Bounded Spanning Tree Problems

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