Research team debuts the first deterministic streaming algorithms for non-monotone submodular maximization, delivering superior approximation ratios with minimal memory and real-time throughput on ...

1 School of Management, University of Shanghai for Science and Technology, Shanghai, China 2 Institute of Mathematical Sciences ICMAT-CSIC, Madrid, Spain In the open capacitated location-routing ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

ABSTRACT: The Collatz Conjecture asserts that for all positive integers s , every Syracuse integer sequence defined by T( s )=s/2 if s is even, and T( s )= ( 3s+1 )/2 otherwise, eventually reaches 1 ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

The **Convex Hull** problem is a fundamental problem in computational geometry, where given a set of points in a 2D plane, the goal is to find the smallest convex polygon that contains all the points.

UAV-based plant protection represents an efficient, energy-saving agricultural technology with significant potential to enhance tea production. However, the complex terrain of hilly and mountainous ...

Abstract: In this paper, we propose the Priority Facility Location Problem with Outliers (PFLPO), which is a generalization of both the Facility Location Problem with Outliers (FLPO) and Priority ...