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

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

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

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

ABSTRACT: Fractional-order time-delay differential equations can describe many complex physical phenomena with memory or delay effects, which are widely used in the fields of cell biology, control ...

ABSTRACT: This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution ...

An international research team has developed a particle swarm optimization (PSO) algorithm based on quantum computing for real-time maximum power point tracking (MPPT) implementation in PV systems.