( en | de | ru )

 

Disambiguation of "Flammini, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the revenue maximization problem with sharp demands.

, , and . Theor. Comput. Sci., (2017)

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 Galletti

Michele Ocken

Michele Ferrari

Hannelore Michele

Michele Cagnoli

 

Other publications of authors with the same name

On Minimizing the Number of ADMs in a General Topology Optical Network., , and . DISC, volume 4167 of Lecture Notes in Computer Science, page 459-473. 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)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)Deadlock-Free Interval Routing Schemes.. STACS, volume 1200 of Lecture Notes in Computer Science, page 351-362. Springer, (1997)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)Approximating the traffic grooming problem., , , and . J. Discrete Algorithms, 6 (3): 472-479 (2008)Performance of One-Round Walks in Linear Congestion Games., , , and . Theory Comput. Syst., 49 (1): 24-45 (2011)Guest Editorial: Special Issue on Algorithmic Game Theory., and . Theory Comput. Syst., 63 (7): 1449-1450 (2019)Learning DNF Formulae Under Classes of Probability Distributions., , and . COLT, page 85-92. ACM, (1992)Graphical Congestion Games., , , and . Algorithmica, 61 (2): 274-297 (2011)