( en | de | ru )

 

Disambiguation of "Shalom, Mordechai"

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.

Mordechai Eliav

 

Other publications of authors with the same name

On Approximating the d-Girth of a Graph., , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 467-481. Springer, (2011)Approximating the Traffic Grooming Problem in Tree and Star Networks., , , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 147-158. Springer, (2006)Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem., , , , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 404-411. Springer, (2007)The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation., , and . SEA², volume 11544 of Lecture Notes in Computer Science, page 21-34. Springer, (2019)On-line maximum matching in complete multi-partite graphs with an application to optical networks., , and . Discret. Appl. Math., (2016)On the complexity of the regenerator location problem treewidth and other parameters., , and . Discret. Appl. Math., (2016)On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology., , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 281-294. Springer, (2009)Online Coalition Structure Generation in Graph Games., , , , and . AAMAS, page 1353-1361. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Online Regenerator Placement., , , and . OPODIS, volume 7109 of Lecture Notes in Computer Science, page 4-17. Springer, (2011)Parameterized complexity of finding a spanning tree with minimum reload cost diameter., , , , , and . Networks, 75 (3): 259-277 (2020)