The Fagnano Triangle Patrolling Problem

We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize the maximum (1-gap) idle time of any edge, which is defined as the time gap between consecutive visits to that edge. This problem has roots in...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 27:3; číslo Discrete Algorithms; s. 1
Hlavní autori:	Georgiou, Konstantinos, Kundu, Somnath, Pralat, Pawel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.10.2025
Predmet:	Combinatorial optimization Mathematical research Canada
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!