NobleBlocks
Public

Interval Coverage Minimum Weight Sum Optimization Algorithm Based on Dual Queue Collaboration and State Compression

Published • Aug 15, 2025
NobleIDNI5P94W52R90S61
Authors:
Linlin Ou
,
Xuemei Chen
,
Zhongwei Liang

Abstract

This paper addresses the performance bottlenecks of traditional dynamic programming when handling large-scale data, such as high time complexity and inefficient demand management, for example, interval coverage problems with demand points and coverage points reaching the order of $5 \times 10^{5}$. ...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!