Online maximum \(k\)-interval coverage problem
From MaRDI portal
Publication:2692231
DOI10.1007/978-3-030-64843-5_31MaRDI QIDQ2692231
Minming Li, Victor C. S. Lee, Song-Hua Li, Lingjie Duan
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64843-5_31
online algorithm; interval coverage; budgeted maximum coverage problem; maximum \(k\)-coverage problem
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)