1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.OC2021
Strong bounds and exact solutions to the minimum broadcast time problem
Marika Ivanova, Dag Haugland, Bård Hennning Tvedt
Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast problem asks for the minimum number of steps in which a signal can be transmitted from t…
cs.MA2017
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents
Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen
We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. The probl…
cs.AI2017★ 1 cited
Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination
Marika Ivanová, Pavel Surynek
We address a problem of area protection in graph-based scenarios with multiple agents. The problem consists of two adversarial teams of agents that move in an undirected graph shar…