ENTITY
maximum coverage problem
maximum coverage problem
PulseAugur coverage of maximum coverage problem — every cluster mentioning maximum coverage problem across labs, papers, and developer communities, ranked by signal.
Total · 30d
1
2 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
1
2 over 90d
TIER MIX · 90D
TOPICS
SENTIMENT · 30D
1 day(s) with sentiment data
RECENT · PAGE 1/1 · 2 TOTAL
-
New multitask optimization method for dynamic constraint problems detailed
Researchers have developed a new multitasking approach for solving monotone submodular optimization problems with dynamic constraints. This method leverages evolutionary multitasking to address multiple related problems…
-
Research on decision tree approximation withdrawn after submission
A recently withdrawn arXiv paper proposed a polynomial-time algorithm for approximating the uniform decision tree problem. The algorithm achieved an approximation ratio of less than 11.57, improving upon previous greedy…