The capacitated minimum spanning tree (CMST) problem is one of the most fundamental and significant problems in the optimal design of communication networks. In this paper several methods are proposed to improve existing node-oriented branch and bound algorithm for the CMST problem. Techniques for acquiring tighter lower bound are emphasized, while regulations for faster traversing of the searc...

We consider the Critical Node Problem: given an undirected graph and an integer number K, at most K nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple “hybrid” heuristic algorithm. The obtained algorithms are shown to be...

In this paper, we give an algorithm for the nodeto-set disjoint paths problem in rotator graphs with its evaluation results. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The sum of the length of paths obtained and the time complexity of the algorithm are...

A fundamental problem in wireless sensor networks is to maximize network lifetime under given energy constraints. In this paper, we study the network lifetime problem by considering not only maximizing the time until the first node fails, but also maximizing the lifetimes for all the nodes in the network, which we define as the Lexicographic Max-Min (LMM) node lifetime problem. The main contrib...

nowadays, with the advent of new satellite services, the need for resource management in the emerging fifth generation satellite systems (5g-satellite) is inevitable. thus, to solve this problem, the bandwidth manager for resource reservation in satellite link is mandatory. on the other hand, due to limited resources, their resource management­ is essential. in order to resource management in 5...

This paper describes a node capacitated in-tree packing problem. The input consists of a directed graph, a root node, a node capacity function and edge consumption functions. The problem is to find the maximum number of rooted in-trees such that the total consumption of in-trees at each node does not exceed the capacity of the node. The problem is one of the network lifetime problems that are a...

In this paper, we deal with a node capacitated in-tree packing problem. The input consists of a directed graph, a root node, a node capacity function and edge consumption functions. The problem is to find the maximum number of rooted in-trees such that the total consumption of in-trees at each node does not exceed the capacity of the node. The problem is one of the network lifetime problems tha...

Evgeny Levinkov, Jonas Uhrig, Siyu Tang, Mohamed Omran, Eldar Insafutdinov, Alexander Kirillov, Carsten Rother, Thomas Brox, Bernt Schiele and Bjoern Andres Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany Max Planck Institute for Intelligent Systems, Tübingen, Germany Daimler AG R&D, Sindelfingen, Germany Computer Vision Lab, University of Freiburg, Germa...

In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for cycle, cycle with ears, knapsack tr...

Mouse sarcoma cells derived from recent methyicholanthrene-induced tumors of known genotypes were inoculated into isologous or homologous hosts after incubation with serum or lymph node cells from different sources. Isoantiserum enhanced the out growth of the tumors in genetically incompatible, homologous systems, whereas in isologous systems it had no effect. Lymph node cells of preimmunized h...