Nor M lt always easy to assess the relevance of a new result to a particular problem.
Furthermore, changes in parallel computing technology have made some of the earlier work …

Data center networks have been becoming more and more important with the development
of cloud computing. For any two integers k≥ 0 and n≥ 2, the k-dimensional DCell with n …

We study the algorithmic complexity of partitioning the vertex set of a given (di) graph into a
small number of paths. The Path Partition problem (PP) has been studied extensively, as it …

The k-ary n-cube Q nk serves as an indispensable interconnection network in the design of
data center networks, network-on-chips, and parallel computing systems since it possesses …

For a decade swarm Intelligence deals with the design of intelligent multi-agent systems by
taking inspiration from the collective behaviors of social insects and other animal societies …

We present an approximation algorithm, with a performance ratio of at most 17⧸ 12, for the
asymmetric travelling salesman problem with distances one and two. This problem is …

A path cover (or in short: cover) of a graph G is a set of vertex-disjoint paths which cover all
the vertices of G. An optimal cover of G is a cover of the smallest possible cardinality …

A minimum Hamiltonian completion of a graph G is a minimum-size set of edges that, when
added to G, guarantee a Hamiltonian path. Finding a Hamiltonian completion has …

This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight,
called TSP. We show that TSP is 2/3-differential approximable and cannot be differential …

We consider the problem of covering a weighted graph G=(V, E) by a set of vertex‐disjoint
paths, such that the total weight of these paths is maximized. This problem is clearly NP …