The Searchlight Scheduling Problem

DOI10.1137/0219070zbMath0711.68085OpenAlexW2088753707MaRDI QIDQ3495667

Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219070

zbMATH Keywords

visibilitysearch scheduleone-way sweep strategysearchlights

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (11)

Searching a polygonal region by a group of stationary \(k\)-searchers ⋮ SEARCHING POLYHEDRA BY ROTATING HALF-PLANES ⋮ Unnamed Item ⋮ An annotated bibliography on guaranteed graph searching ⋮ A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING ⋮ Cops and robber game without recharging ⋮ SEARCHING A POLYGONAL REGION FROM THE BOUNDARY ⋮ SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ CONTINUOUS SURVEILLANCE OF POINTS BY ROTATING FLOODLIGHTS ⋮ The searchlight problem for road networks

This page was built for publication: The Searchlight Scheduling Problem