Sfoglia per Autore
Minimizing the number of ADMs with and without traffic grooming: complexity and approximability
2006-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Approximating the Traffic Grooming Problem in Tree and Star Networks
2006-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem
2007-01-01 DI GIANNANTONIO, S.; Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
2008-01-01 Caragiannis, I.; Monaco, Gianpiero
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs
2008-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Approximating the Traffic Grooming Problem in Tree and Star Networks
2008-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem
2008-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Minimizing total busy time in parallel scheduling with application to optical networks
2009-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shachnai, H.; Shalom, M.; Tamirk, T.; Zaks, S.
Traffic Grooming: Combinatorial Results and Practical Resolutions
2010-01-01 Cinkler, T.; Coudert, D.; Flammini, Michele; Monaco, Gianpiero; Moscardelli, L.; Munoz, X.; SAU VALLS, I.; Shalom, M.; Zaks, S.
Game-Theoretic Approaches to Optimization Problems in Communication Networks
2010-01-01 Bilo', V.; Caragiannis, I.; Fanelli, A.; Flammini, Michele; Kaklamanis, C.; Monaco, Gianpiero; Moscardelli, L.
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks
2010-01-01 Michele, Flammini; Gianpiero, Monaco; Moscardelli, Luca; Hadas, Shachnai; Mordechai, Shalom; Tami, Tamir; Shmuel, Zaks; Monaco, Gianpiero
Improved lower bounds on the price of stability of undirected network design games
2010-01-01 Bilo', V.; Caragiannis, I.; Fanelli, A.; Monaco, Gianpiero
Optimizing regenerator cost in traffic grooming
2011-01-01 Michele, Flammini; Gianpiero, Monaco; Moscardelli, Luca; Mordechai, Shalom; Shmuel, Zaks; Monaco, Gianpiero
On the Performances of Nash Equilibria in Isolation Games
2011-01-01 Bilò, V.; Flammini, M.; Monaco, G.; Moscardelli, Luca
The ring design game with fair cost allocation
2012-01-01 Fanelli, A.; Leniowski, D.; Monaco, Gianpiero; Sankowski, P.
Mobile Network Creation Games
2012-01-01 Flammini, M.; Gallotti, V.; Melideo, G.; Monaco, G.; Moscardelli, Luca
Some Anomalies of Farsighted Strategic Behavior
2013-01-01 Bilo', V.; Flammini, Michele; Monaco, Gianpiero; Moscardelli, L.
Improved lower bounds on the price of stability of undirected network design games
2013-01-01 Bilo', V.; Caragiannis, I.; Fanelli, A.; Monaco, Gianpiero
A 6/5-approximation algorithm for the maximum 3-cover problem
2013-01-01 Caragiannis, I.; Monaco, G.
Approximating the Revenue Maximization Problem with Sharp Demands
2014-01-01 Bilo', V.; Flammini, Michele; Monaco, Gianpiero
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. | |
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. | |
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem | 2008 | Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S. | |
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. | |
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. | |
Game-Theoretic Approaches to Optimization Problems in Communication Networks | 2010 | Bilo', V.; Caragiannis, I.; Fanelli, A.; Flammini, Michele; Kaklamanis, C.; Monaco, Gianpiero; Moscardelli, L. | |
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks | 2010 | Michele, Flammini; Gianpiero, Monaco; Moscardelli, Luca; Hadas, Shachnai; Mordechai, Shalom; Tami, Tamir; Shmuel, Zaks; Monaco, Gianpiero | |
Improved lower bounds on the price of stability of undirected network design games | 2010 | Bilo', V.; Caragiannis, I.; Fanelli, A.; Monaco, Gianpiero | |
Optimizing regenerator cost in traffic grooming | 2011 | Michele, Flammini; Gianpiero, Monaco; Moscardelli, Luca; Mordechai, Shalom; Shmuel, Zaks; Monaco, Gianpiero | |
On the Performances of Nash Equilibria in Isolation Games | 2011 | Bilò, V.; Flammini, M.; Monaco, G.; Moscardelli, Luca | |
The ring design game with fair cost allocation | 2012 | Fanelli, A.; Leniowski, D.; Monaco, Gianpiero; Sankowski, P. | |
Mobile Network Creation Games | 2012 | Flammini, M.; Gallotti, V.; Melideo, G.; Monaco, G.; Moscardelli, Luca | |
Some Anomalies of Farsighted Strategic Behavior | 2013 | Bilo', V.; Flammini, Michele; Monaco, Gianpiero; Moscardelli, L. | |
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. | |
Approximating the Revenue Maximization Problem with Sharp Demands | 2014 | Bilo', V.; Flammini, Michele; Monaco, Gianpiero |
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