Approximation algorithms for the design of SDH/SONET networks

Nuclear cathepsin D enhances TRPS1 transcriptional repressor function to regulate cell cycle progression and transformation in human breast cancer

The Single policy enforces that all requests of a client are served by a single server in the tree, while in the Multiple policy, the requests of a given client can be processed

We first prove that the minimum and maximum traveling salesman prob- lems, their metric versions as well as some versions defined on parameterized triangle inequalities

Specifically, the lower bounds in the NP witness setting imply that at least for some natural choices of the distance function any non-trivial structure approximation is as hard

There is a constant ε ∈]0; 1[ such that if two trees sampled accord- ing to P [h] n have a unique spine decomposition up to height r, then the probability that they are isomorphic

We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the

Tabu search algorithms to minimize the total tardiness in a flow shop production and outbound distribution scheduling problem. In Proceedings of the International Conference

We provide numerical results for a set of realistic-size instances and investigate the impact of different parameters on the SON design problem, such as number and installation cost