( en | de | ru )

 

Disambiguation of "Zaks, Shmuel"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.

, , , , and . Algorithmica, 68 (3): 671-691 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Zaks

Ascher Ben-Shmuel

 

Other publications of authors with the same name

Hierarchical b-Matching., , , and . CoRR, (2019)Maximizing Communication Throughput in Tree Networks., , , , and . CoRR, (2019)Online Lower Bounds and Offline Inapproximability in Optical Networks.. ADHOC-NOW, volume 9143 of Lecture Notes in Computer Science, page 253-270. Springer, (2015)On the Intersection of Tolerance and Cocomparability Graphs., and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 230-240. Springer, (2010)Optimal Linear Broadcast Routing with Capacity Limitations., and . ISAAC, volume 762 of Lecture Notes in Computer Science, page 287-296. Springer, (1993)Profit Maximization in Flex-Grid All-Optical Networks., , and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 249-260. Springer, (2013)A Scalable Approach to Routing in ATM Networks., , and . WDAG, volume 857 of Lecture Notes in Computer Science, page 209-222. Springer, (1994)DISC at Its 20th Anniversary (Stockholm, 2006)., , and . DISC, volume 4731 of Lecture Notes in Computer Science, page 501-503. Springer, (2007)Approximation Algorithms for Survivable Optical Networks., , and . DISC, volume 1914 of Lecture Notes in Computer Science, page 104-118. Springer, (2000)On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming., , , , and . Algorithmica, 68 (3): 671-691 (2014)