Google Revealed A Futuristic Quantum Algorithm Faster Than Supercomputers

Google's Quantum Echoes algorithm brings us closer to a world where quantum technology has useful applications. Here's what ...
GitHub

Add Kadane's Algorithm for Maximum Subarray Sum (DP Approach)

This PR adds an implementation of Kadane's Algorithm, an efficient dynamic programming approach to solve the Maximum Subarray Sum problem in O(n) time. Initializes current and global maximum values.
Microsoft

A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time

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

Hybrid genetic algorithm and Q-learning-based solution for the time-variant berth and quay crane allocation problem

Institute of Logistics Science and Engineering of Shanghai Maritime University, Pudong, China Introduction: This study addresses the joint scheduling optimization of continuous berths and quay cranes ...
IEEE

Approximation and Heuristic Algorithms for the Priority Facility Location Problem with Outliers

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

An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem

Quantum annealers can be used to solve many (possibly NP-hard) combinatorial optimization problems, by formulating them as quadratic unconstrained binary optimization (QUBO) problems or, equivalently, ...
www.cs.cmu.edu

Better streaming algorithms for Maximum Directed Cut via 'snapshots'

\[ \gdef\bias{\mathrm{bias}} \gdef\deg{\mathrm{deg}} \gdef\indeg{\mathrm{indeg}} \gdef\outdeg{\mathrm{outdeg}} \gdef\Snap{\mathrm{Snap}} \gdef\RSnap{\mathrm{RefSnap ...