IRIS

Sfoglia per Autore  

Opzioni
Mostrati risultati da 1 a 20 di 74
Titolo Data di pubblicazione Autore(i) File
Minimizing the number of ADMs with and without traffic grooming: complexity and approximability 2006 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Approximating the Traffic Grooming Problem in Tree and Star Networks 2006 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 2007 DI GIANNANTONIO, S.; Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 2008 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 2008 Caragiannis, I.; Monaco, Gianpiero
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 2008 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Approximating the Traffic Grooming Problem in Tree and Star Networks 2008 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
On the complexity of the regenerator placement problem in optical networks 2009 Flammini, Michele; Marchetti Spaccamela, Alberto; Monaco, Gianpiero; Moscardelli, Luca; Zaks, Shmuel
Minimizing total busy time in parallel scheduling with application to optical networks 2009 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shachnai, H.; Shalom, M.; Tamirk, T.; Zaks, S.
Improved lower bounds on the price of stability of undirected network design games 2010 Bilo', V.; Caragiannis, I.; Fanelli, A.; Monaco, Gianpiero
Traffic Grooming: Combinatorial Results and Practical Resolutions 2010 Cinkler, T.; Coudert, D.; Flammini, Michele; Monaco, Gianpiero; Moscardelli, L.; Munoz, X.; SAU VALLS, I.; Shalom, M.; Zaks, S.
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 2010 Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shachnai, Hadas; Shalom, Mordechai; Tamir, Tami; Zaks, Shmuel
Game-Theoretic Approaches to Optimization Problems in Communication Networks 2010 Bilo', V.; Caragiannis, I.; Fanelli, A.; Flammini, Michele; Kaklamanis, C.; Monaco, Gianpiero; Moscardelli, L.
On the Performances of Nash Equilibria in Isolation Games 2011 Bilò, V.; Flammini, M.; Monaco, G.; Moscardelli, Luca
On the complexity of the regenerator placement problem in optical networks 2011 Flammini, Michele; Marchetti-Spaccamela, Alberto; Monaco, Gianpiero; Moscardelli, Luca; Zaks, Shmuel
Optimizing regenerator cost in traffic grooming 2011 Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
Mobile Network Creation Games 2012 Flammini, M.; Gallotti, V.; Melideo, G.; Monaco, G.; Moscardelli, Luca
The ring design game with fair cost allocation 2012 Fanelli, A.; Leniowski, D.; Monaco, Gianpiero; Sankowski, P.
Improved lower bounds on the price of stability of undirected network design games 2013 Bilo', V.; Caragiannis, I.; Fanelli, A.; Monaco, Gianpiero
A 6/5-approximation algorithm for the maximum 3-cover problem 2013 Caragiannis, I.; Monaco, G.
Mostrati risultati da 1 a 20 di 74
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile