Part 6: Approximation Algorithms and Complexity References: (2009)
Module Organiser, Leslie Ann Goldberg, G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, ...
Coping with hard computational problems A large number of the optimisation problems, including those that we need to solve in practice, are NP-hard. These problems are unlikely to have an efficient...
Part 6: Approximation Algorithms and Complexity References: (2008)
Module Organiser, Leslie Ann Goldberg, G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, ...
Coping with hard computational problems A large number of the optimisation problems, including those that we need to solve in practice, are NP-hard. These problems are unlikely to have an efficient...
Part 6: Approximation Algorithms and Complexity References: (2008)
Module Organiser, Leslie Ann Goldberg, G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, ...
Coping with hard computational problems A large number of the optimisation problems, including those that we need to solve in practice, are NP-hard. These problems are unlikely to have an efficient...
L. Becchetti, S. L. Bezrukov, A. Marchetti-spaccamela, M. Ottaviani, R. Preis, M. Rottger, ...
F. d'Amore 1
L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-spaccamela, S. Muthukrishnan, T. Nandagopal, ...
Next generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users...
Parallel scheduling problems in next generation wireless networks (2002)
L.Becchetti, S. N. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandagopal, ...
The Complexity of Interval Routing on Random Graphs (1998)
Flammini, M., Van Leeuwen, J., Marchetti-Spaccamela, A.
Several methods exist for routing messages in a network without using complete routing tables (compact routing). In k-interval routing schemes (k-IRS), links carry up to k intervals each. A message...
On the Embedding of Refinements of 2-dimensional Grids (1997)
F. D'Amore, L. Becchetti, S.L. Bezrukov, A. Marchetti-spaccamela, M. Ottaviani, R. Preis, ...
. We consider the problem of constructing embeddings of 2dimensional FEM graphs into grids. Our goal is to minimize the edgecongestion and dilation and optimize the load. We introduce some...
Parallel scheduling problems in next generation wireless networks (1997)
L. Becchetti, S. Leonardi, A. Marchetti-spaccamela, A. Vitaletti, S. Diggavi, S. Muthukrishnan, ...
Next-generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users...
The complexity of interval routing on random graphs (1995)
M. Flammini, J. Van Leeuwen, A. Marchetti-spaccamela, Michele Flammini, Jan Van Leeuwen, Alberto Marchetti-spaccamela
Abstract. Several methods exist for routing messages in a network without using complete routing tables (compact routing). In k-interval routing schemes (k-IR.S), links carry up to k intervals each....