Mordechai Shalom

Dr. Mordechai Shalom

Department of Computer Engineering, Işık University, Istanbul 34980, Turkey
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2017 in Information Processing Letters
Verified
Journal Article
Closed access
ABArman Boyacı
Arman Boyacı
TETinaz Ekim
Tinaz Ekim
MSMordechai Shalom
Mordechai Shalom

16 February 2012 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
GMGeorge B. Mertzios
George B. Mertzios
ISIgnasi Sau
Ignasi Sau
MSMordechai Shalom
Mordechai Shalom
SZShmuel Zaks
Shmuel Zaks
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 a positive integer $d$ , regenerators must be placed in such a way that in any lightpath there are no more than $d$ hops without meeting a regenerator. The cost function we consider is given by the total number of regenerators placed at the nodes, which we believe to be a more accurate estimation of the real cost of the network than the number of locations considered in the work of Flammini (IEEE/ACM Trans. Netw., vol. 19, no. 2, pp. 498–511, Apr. 2011). Furthermore, in our model we assume that we are given a finite set of $p$ possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when $d=1$ or $p=1$, we prove that for any fixed $d,p \geq 2$, it does not admit a PTAS, even if $G$ has maximum degree at most 3 and the lightpaths have length $ {\cal O}(d)$. We complement this hardness result with a constant-factor approximation algorithm with ratio $\ln (d \cdot p)$. We then study the case where $G$ is a path, proving that the problem is polynomial-time solvable for two particular families of instances. Finally, we generalize our model in two natural directions, which allows us to capture the model of Flammini as a particular case, and we settle some questions that were left open therein.

1 March 2016 in Theoretical Computer Science
Verified
Journal Article
Closed access
DGDidem Gözüpek
Didem Gözüpek
HSHadas Shachnai
Hadas Shachnai
MSMordechai Shalom
Mordechai Shalom
SZShmuel Zaks
Shmuel Zaks

1 June 2014 in Theoretical Computer Science
Verified
Journal Article
Closed access
DGDidem Gözüpek
Didem Gözüpek
MSMordechai Shalom
Mordechai Shalom
AVAriella Voloshin
Ariella Voloshin
SZShmuel Zaks
Shmuel Zaks

23 October 2015 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
ABArman Boyacı
Arman Boyacı
TETınaz Ekim
Tınaz Ekim
MSMordechai Shalom
Mordechai Shalom

29 September 2011 in Theoretical Computer Science
Verified
Journal Article
Closed access
PDF file
Michele FlamminiMichele Flammini
Michele Flammini
GMGianpiero Monaco
Gianpiero Monaco
LMLuca Moscardelli
Luca Moscardelli
MSMordechai Shalom
Mordechai Shalom
SZShmuel Zaks
Shmuel Zaks