This paper studies the fair influence maximization problem with efficient algorithms. In particular, given a graph G, a community structure C consisting of disjoint communities, and a budget k, the ...

The original version of this story appeared in Quanta Magazine. In 1939, upon arriving late to his statistics course at UC Berkeley, George Dantzig—a first-year graduate student—copied two problems ...

The leading approach to the simplex method, a widely used technique for balancing complex logistical constraints, can’t get any better. In 1939, upon arriving late to his statistics course at the ...

Introduction: In unsupervised learning, data clustering is essential. However, many current algorithms have issues like early convergence, inadequate local search capabilities, and trouble processing ...

Social Networks have been in continuous growing during the last decades. The huge amount of information and applications has led to an increase in the interest of scientists and practitioners in the ...

This Repository contains topics related to computer optimization, computer orientation, operation research. Optimization techniques are methods used to find the best possible solution or outcome for a ...

Which A.I. system writes the best computer code or generates the most realistic image? Right now, there’s no easy way to answer those questions. Credit...Davide Comai Supported by By Kevin Roose ...

ABSTRACT: In this work, a new method is presented for determining the binding constraints of a general linear maximization problem. The new method uses only objective function values at points which ...