Quantum computers are expected to have substantial impact on the finance industry, as they
will be able to solve certain problems considerably faster than the best known classical …

Boolean functions are perhaps the most basic objects of study in theoretical computer
science. They also arise in other areas of mathematics, including combinatorics, statistical …

Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

There is an increasing interest in quantum algorithms for problems of integer programming
and combinatorial optimization. Classical solvers for such problems employ relaxations …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We consider the following general correlation-clustering problem [N. Bansal, A. Blum, S.
Chawla, Correlation clustering, in: Proc. 43rd Annu. IEEE Symp. on Foundations of …

In many networks, it is of great interest to identify communities, unusually densely knit
groups of individuals. Such communities often shed light on the function of the networks or …

The correlation clustering problem identifies clusters in a set of objects when the qualitative
information about objects' mutual similarities or dissimilarities is given in a signed network …

Given a complete graph G=(V, E) where each edge is labeled+ or−, the CORRELATION
CLUSTERING problem asks to partition V into clusters to minimize the number of+ edges …

Probably the most famous of Grothendieck's contributions to Banach space theory is the
result that he himself described as “the fundamental theorem in the metric theory of tensor …