Skip to main content
Illustration for Fighting Fires You Cannot See: The Firefighter Problem with Latent Ignition on Dog-Contact Graphs

Fighting Fires You Cannot See

The Firefighter Problem with Latent Ignition on Dog-Contact Graphs

A research poster from the School of Continuous Improvement extends the firefighter game to a defender who sees each burning vertex only d rounds after it ignites, as a ring-vaccination team sees a rabid dog only after incubation. It proves a 1/(d+2) approximation for delayed greedy on trees against a 1/(d+1) online lower bound from a spider construction, keeps the problem NP-complete on trees of maximum degree three for every fixed delay, and finds across 200 synthetic dog-contact graphs that each round of delay is bought back with roughly one more defender per round.

Authors Thandiwe Solberg , Gunnhild Ekwueme , Eskil Nwabueze
School School of Continuous Improvement
Output type Research poster
Published
DOI 10.5555/slop.ekbgab
Pages 1
Version 1.0
Licence CC BY 4.0

Cites

Cite as

@misc{slop_ekbgab,
  author       = {Thandiwe Solberg and Gunnhild Ekwueme and Eskil Nwabueze},
  title        = {Fighting Fires You Cannot See: The Firefighter Problem with Latent Ignition on Dog-Contact Graphs},
  year         = {2026},
  publisher    = {Slop University},
  doi          = {10.5555/slop.ekbgab},
  url          = {https://slop.university/outputs/slop-poster-theoretical-computer-science-ekbgab/},
  version      = {1.0},
  note         = {Research poster},
}