This paper presents theoretical and practical results for the bin packin...
In the Multiple Allocation k-Hub Center (MAkHC), we are given a connecte...
The cut-set ∂(S) of a graph G=(V,E) is the set of edges that have
one en...
In the MAXSPACE problem, given a set of ads A, one wants to schedule a s...
A bond of a graph G is an inclusion-wise minimal disconnecting set of G,...