The hypergraph assignment problem

TL;DR: An interface problem is defined in order to bridge between the RSRP and the VRP and derive a straightforward algorithmic concept, namely regional search (RS), from their common features and, moreover, differences.

TL;DR: AligNet is presented, a new pairwise global PPIN aligner that produces biologically meaningful alignments, by achieving a good balance between structural matching and protein function conservation, and more efficient computations than state-of-the-art tools.

TL;DR: This paper proposes a distributed hyperedge partition algorithm, HyperSwap, to partition the hypergraph into balanced sub-hypergraph as required, without global information and central coordination, and shows the feasibility, evaluate it on Facebook dataset with various settings, and compare it against two alternative solutions.

TL;DR: A new coarse-to-fine approach to solve certain linear programs by column generation that shifts the pricing of a fine linear program to a coarse counterpart, which takes major decisions in the coarse layer, while minor details are tackled within the fine layer.

TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.

TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.

TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.