( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating the traffic grooming problem.

, , , и . J. Discrete Algorithms, 6 (3): 472-479 (2008)

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.

Mordechai Eliav

 

Другие публикации лиц с тем же именем

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II., , , и . Discret. Math. Theor. Comput. Sci., (2018)Selfishness, collusion and power of local search for the ADMs minimization problem., , , , и . Comput. Networks, 52 (9): 1721-1731 (2008)A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks., , и . IEEE/ACM Trans. Netw., 23 (1): 317-328 (2015)Edge Coloring with Minimum Reload/Changeover Costs., и . CoRR, (2016)On Approximating the d-Girth of a Graph., , и . SOFSEM, том 6543 из Lecture Notes in Computer Science, стр. 467-481. Springer, (2011)Approximating the Traffic Grooming Problem in Tree and Star Networks., , , , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 147-158. Springer, (2006)Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem., , , , , и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 404-411. Springer, (2007)On-line maximum matching in complete multi-partite graphs with an application to optical networks., , и . Discret. Appl. Math., (2016)On the complexity of the regenerator location problem treewidth and other parameters., , и . Discret. Appl. Math., (2016)The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation., , , , и . Algorithms, 14 (5): 151 (2021)