( en | de | ru )

 

Disambiguation of "Flammini, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the traffic grooming problem.

, , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Michele Luminati

Michele Albertini

Michèle Mattusch

Michele Cagnoli

Michele Susca

 

Other publications of authors with the same name

Learning DNF Formulae Under Classes of Probability Distributions., , and . COLT, page 85-92. ACM, (1992)On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles., , and . SIROCCO, volume 17 of Proceedings in Informatics, page 133-145. Carleton Scientific, (2003)Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves., , , and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 363-374. Springer, (2006)A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load., , and . Parallel Process. Lett., 8 (2): 207-220 (1998)Graphical Congestion Games., , , and . Algorithmica, 61 (2): 274-297 (2011)Optimizing regenerator cost in traffic grooming., , , , and . Theor. Comput. Sci., 412 (52): 7109-7121 (2011)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , and . Theor. Comput. Sci., 411 (40-42): 3553-3562 (2010)When ignorance helps: Graphical multicast cost sharing games., , , and . Theor. Comput. Sci., 411 (3): 660-671 (2010)On routing of wavebands for all-to-all communications in all-optical paths and cycles., , and . Theor. Comput. Sci., 333 (3): 401-413 (2005)Pareto approximations for the bicriteria scheduling problem., , and . J. Parallel Distributed Comput., 66 (3): 393-402 (2006)