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

Researchers have successfully used a quantum algorithm to solve a complex century-old mathematical problem long considered impossible for even the most powerful conventional supercomputers. The ...

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

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

This paper deals with the two-dimensional strip packing problem (2D-SPP) with the order/or multi-drop and vertical stability constraints. The existing exact algorithm that solves this problem is not ...

This paper is devoted to find the numerical solutions of one dimensional general nonlinear system of third-order boundary value problems (BVPs) for the pair of functions using Galerkin weighted ...