Online maximum \(k\)-interval coverage problem

DOI10.1007/978-3-030-64843-5_31OpenAlexW3114406186MaRDI QIDQ2692231

Victor C. S. Lee, Lingjie Duan, Minming Li, Song-Hua Li

Publication date: 21 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64843-5_31

zbMATH Keywords

online algorithminterval coveragebudgeted maximum coverage problemmaximum \(k\)-coverage problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Efficient algorithms for ride-hitching in UAV travelling ⋮ Online ride-hitching in UAV travelling ⋮ Online algorithms for the maximum \(k\)-interval coverage problem

This page was built for publication: Online maximum \(k\)-interval coverage problem