( en | de | ru )

 

Disambiguation of "Flammini, Michele"

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 . OPODIS, volume 7109 of Lecture Notes in Computer Science, page 96-111. Springer, (2011)

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 Ocken

Michele Ferrari

Michele Galletti

Hannelore Michele

Michèle Mattusch

 

Other publications of authors with the same name

Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way., , , , , and . Models, Languages, and Tools for Concurrent and Distributed Programming, volume 11665 of Lecture Notes in Computer Science, page 7-12. Springer, (2019)Boolean Routing., , and . WDAG, volume 725 of Lecture Notes in Computer Science, page 219-233. Springer, (1993)The Complexity of Interval Routing on Random Graphs., , and . MFCS, volume 969 of Lecture Notes in Computer Science, page 37-49. Springer, (1995)On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing., , and . CAAN, volume 4235 of Lecture Notes in Computer Science, page 72-85. Springer, (2006)Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols., and . SIAM J. Discret. Math., 17 (4): 521-540 (2004)On the convergence of multicast games in directed networks., , and . SPAA, page 330-338. ACM, (2007)Experimental Evaluations of Algorithms for IP Table Minimization., , , , and . WEA, volume 4525 of Lecture Notes in Computer Science, page 324-337. Springer, (2007)On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming., , , , and . Algorithmica, 68 (3): 671-691 (2014)Distance Polymatrix Coordination Games (short paper)., , , and . IPS-RCRA-SPIRIT@AI*IA, volume 3585 of CEUR Workshop Proceedings, CEUR-WS.org, (2023)Approximating the Revenue Maximization Problem with Sharp Demands., , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 74-85. Springer, (2014)