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 ...

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 ...

Abstract: We present fully polynomial approximation algorithm for generalized maximum concurrent flow problem with budget constraint that run in time independent of the number of commodities k. We ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Children as young as 4 years old are capable of finding efficient solutions to complex problems, such as independently inventing sorting algorithms developed by computer scientists. The scientists ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

AlphaEvolve uses large language models to find new algorithms that outperform the best human-made solutions for data center management, chip design, and more. Google DeepMind has once again used large ...

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: In applied and numerical algebraic geometry, many problems are reduced to computing an approximation to a real algebraic curve. In order to elevate the results of such a computation to the ...

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.