In this paper we study information flow paths in a data network, where traffic generated by servers ( or sources) takes a multi-hop path in order to reach its clients (destinations). Each node in the middle of this multi-hop path should route the incoming traffic and the traffic generated by itself to the next hop in such a way that the traffic reaches its destination while avoiding congestion ...

Abstract The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that NMC disconnects given terminals, SFVS intersects all cycles containing set. We design meta-algorithm allows to solve in time $$2^{O(rw^3)}\cdot n^{4}$$ <mml:m...

In this paper, we address the combined assortment and trim loss minimization problem. In real settings, when different stock lengths are available, a common problem is to select a subset of stock lengths from which to cut the ordered items. In the cutting and packing literature, this problem is known as the assortment problem. Solving the assortment and trim loss minimization problem in a singl...

The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial probl...

a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...

An (n,M) vector code C ⊆ F is a collection ofM codewords where n elements (from the field F) in each of the codewords are referred to as code blocks. Assuming that F ∼= B, the code blocks are treated as l-length vectors over the base field B. Equivalently, the code is said to have the sub-packetization level l. This paper addresses the problem of constructing MDS vector codes which enable exact...

abstract background: the study was established to define the prevalence of neonatal microcytosis and to estimate the incidence rate of alpha-thalassemia as its leading cause, in tehran, iran. materials and methods: overall, 800 neonates were selected from two populations of newborns and admitted neonates. three hundred and sixty-one cord blood samples were obtained from deliveries in mahdieh ho...