Geodesic

Volume 23 (2016) no. 2

Table of contents

Enumeration of labeled connected graphs with given order and number of edges
p. 5-20
Fully polynomial-time approximation scheme for a sequence $2$-clustering problem
p. 21-40
On complexity of optimal recombination for flowshop scheduling problems
p. 41-62
Network flow assignment as a fixed point problem
p. 63-87
On the maximal component algebraic immunity of vectorial Boolean functions
p. 88-99
Comparative study of two fast algorithms for projecting a point to the standard simplex
p. 100-123
On the jubilee of A. D. Korshunov