Online maximum k-interval coverage problem

DOI10.1007/978-3-030-64843-5_31MaRDI QIDQ2692231zbMATH OpenOpenAlexFDO

Authors Minming Li, Lingjie Duan, Victor C. S. Lee, Songhua Li

Publication date 21 March 2023

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

zbMATH Keywords

budgeted maximum coverage probleminterval coveragemaximum \(k\)-coverage problemonline algorithm

Mathematics Subject Classification ID

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

Recommendations

• Online algorithms for the maximum \(k\)-interval coverage problem
• Online maximum \(k\)-coverage
• Online maximum \(k\)-coverage
• The Online Submodular Cover Problem
• Approximating sparse covering integer programs online
• Approximating sparse covering integer programs online
• Online and dynamic algorithms for set cover
• On the sum minimization version of the online bin covering problem
• Online primal-dual algorithms for covering and packing
• The online set cover problem

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692231)