The subinterval cover problem

DOI10.1007/978-981-96-8312-3_12MaRDI QIDQ6897293zbMATH OpenFDO

Authors Kelin Luo, Chenran Yang, Zonghan Yang, Yu-Hao Zhang

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-8312-3_12

zbMATH Keywords

approximation algorithmdynamic programmingsubinterval cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• Almost optimal set covers in finite VC-dimension
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
• Collaborative delivery on a fixed path with homogeneous energy-constrained agents
• Collaborative delivery with energy-constrained mobile robots
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• Data delivery by energy-constrained mobile agents
• Data delivery by energy-constrained mobile agents on a line
• Hitting sets when the VC-dimension is small
• On the discrete unit disk cover problem
• On the fast delivery problem with one or two packages
• Optimal packing and covering in the plane are NP-complete
• Package delivery using drones with restricted movement areas
• The NP-completeness column: An ongoing guide
• The Theory of Round Robin Tournaments
• Weighted geometric set cover problems revisited

This page was built for publication: The subinterval cover problem

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