Search Results - "Zaks, Shmuel"

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation by Flammini, Michele, Monaco, Gianpiero, Moscardelli, Luca, Shalom, Mordechai, Zaks, Shmuel

“…All-optical networks transmit messages along lightpaths in which the signal is transmitted using the same wavelength in all the relevant links. We consider the…”
Get full text

Profit Maximization in Flex-Grid All-Optical Networks by Shalom, Mordechai, Wong, Prudence W. H., Zaks, Shmuel

“…All-optical networks have been largely investigated due to their high data transmission rates. The key to the high speeds in all-optical networks is to…”
Get full text

On the Online Coalition Structure Generation Problem by Flammini, Michele, Monaco, Gianpiero, Moscardelli, Luca, Shalom, Mordechai, Zaks, Shmuel

“…We consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online…”
Get full text

Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks by Sciancalepore, Vincenzo, Mancuso, Vincenzo, Banchs, Albert, Zaks, Shmuel, Capone, Antonio

“…Opportunistic traffic offloading has been proposed to tackle overload problems in cellular networks. However, existing proposals only address…”
Get full text

Flexible bandwidth assignment with application to optical networks by Shachnai, Hadas, Voloshin, Ariella, Zaks, Shmuel

“…We introduce two scheduling problems, the flexible bandwidth allocation problem  ( FBAP ) and the flexible storage allocation problem ( FSAP ). In both…”
Get full text

On the intersection of tolerance and cocomparability graphs by Mertzios, George B., Zaks, Shmuel

“…Tolerance graphs have been extensively studied since their introduction, due to their interesting structure and their numerous applications, as they generalize…”
Get full text

Multicast Communications with Varying Bandwidth Constraints by Emek, Yuvak, Kutten, Shay, Shalom, Mordechai, Zaks, Shmuel

“…To find a maximum number of communication requests that can be satisfied concurrently, is a fundamental network scheduling problem. In this work we investigate…”
Get full text

On the complexity of the regenerator location problem treewidth and other parameters by Hartstein, Itamar, Shalom, Mordechai, Zaks, Shmuel

“…We deal with the Regenerator Location Problem in optical networks. We are given a network G=(V,E), and a set Q of communication requests between pairs of…”
Get full text

Optimizing bandwidth allocation in elastic optical networks with application to scheduling by Shachnai, Hadas, Voloshin, Ariella, Zaks, Shmuel

“…We study a problem of optimal bandwidth allocation in the elastic optical networks technology, where usable frequency intervals are of variable width. In this…”
Get full text

Constructing minimum changeover cost arborescenses in bounded treewidth graphs by Gözüpek, Didem, Shachnai, Hadas, Shalom, Mordechai, Zaks, Shmuel

“…Given an edge-colored graph, an internal vertex of a path experiences a reload cost if it lies between two consecutive edges of different colors. The value of…”
Get full text

Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I by Boyacı, Arman, Ekim, Tınaz, Shalom, Mordechai, Zaks, Shmuel

“…Given a tree and a set P of non-trivial simple paths on it, Vpt(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P of the tree T, and…”
Get full text

Graphs of edge-intersecting and non-splitting paths by Boyacı, Arman, Ekim, Tınaz, Shalom, Mordechai, Zaks, Shmuel

“…The families of Edge Intersection Graphs of Paths in a tree (resp. in a grid) EPT (resp. EPG) are well studied graph classes. Recently we introduced the class…”
Get full text

Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests by Mertzios, George B., Sau, Ignasi, Shalom, Mordechai, Zaks, Shmuel

“…The placement of regenerators in optical networks has become an active area of research during the last few years. Given a set of lightpaths in a network G and…”
Get full text

SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches by Verma, Kshitiz, Zaks, Shmuel, Garcia-Martinez, Alberto

“…Internet is growing rapidly in the developing world now. Stringent budget constraints give rise to networks with tree topology, leaving lesser room to apply…”
Get full text

Minimizing total busy time in parallel scheduling with application to optical networks by Flammini, Michele, Monaco, Gianpiero, Moscardelli, Luca, Shachnai, Hadas, Shalom, Mordechai, Tamir, Tami, Zaks, Shmuel

“…We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = { J 1…”
Get full text

On the complexity of constructing minimum changeover cost arborescences by Gözüpek, Didem, Shalom, Mordechai, Voloshin, Ariella, Zaks, Shmuel

“…The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges…”
Get full text

Optimizing busy time on parallel machines by Mertzios, George B., Shalom, Mordechai, Voloshin, Ariella, Wong, Prudence W.H., Zaks, Shmuel

“…We consider the following fundamental parallel machines scheduling problem in which the input consists of n jobs to be scheduled on a set of identical machines…”
Get full text

On the Complexity of the Regenerator Placement Problem in Optical Networks by Flammini, M, Marchetti-Spaccamela, A, Monaco, G, Moscardelli, L, Zaks, S

“…Placement of regenerators in optical networks has attracted the attention of recent research works in optical networks. In this problem, we are given a network…”
Get full text

Preface by Prencipe, Giuseppe, Zaks, Shmuel

Get full text

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming by Flammini, Michele, Monaco, Gianpiero, Moscardelli, Luca, Shalom, Mordechai, Zaks, Shmuel

“…In a communication network one often needs to combine several communication requests into a path in a physical layer of the network. In these cases the cost is…”
Get full text