# On the Broadcast Routing Problem in Computer Networks

## TL;DR

This paper presents a polynomial-time algorithm for solving the broadcast routing problem in outerplanar graphs, which are relevant in various applications like computational geometry and robotics.

## Contribution

It introduces a novel polynomial-time solution for the broadcast routing problem specifically in outerplanar graphs, expanding the class of graphs where BRP can be efficiently solved.

## Key findings

- Polynomial-time algorithm for BRP in outerplanar graphs
- Applicable to networks in computational geometry and robotics
- Enhances understanding of broadcast routing in special graph classes

## Abstract

Given an undirected graph $G = (V, E)$, and a vertex $r\in V$, an $r$-acyclic orientation of $G$ is an orientation $OE$ of the edges of $G$ such that the digraph $OG = (V, OE)$ is acyclic and $r$ is the unique vertex with indegree equal to 0. For $w\in \mathbb{R}^E_+$, $k(G, w)$ is the value of the $w$-maximum packing of $r$-arborescences for all $r\in V$ and all $r$-acyclic orientations $OE$ of $G$. In this case, the Broadcast Routing (in Computers Networks) Problem (BRP) is to compute $k(G, w)$, by finding an optimal $r$ and an optimal $r$-acyclic orientation. BRP is a mathematical formulation of multipath broadcast routing in computer networks. In this paper, we provide a polynomial time algorithm to solve BRP in outerplanar graphs. Outerplanar graphs are encountered in many applications such as computational geometry, robotics, etc.