Sfoglia per Autore
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path
2004-01-01 Bilo', D.; Proietti, Guido
Augmenting the Edge-Connectivity of a Spider Tree
2004-01-01 Bilo', D.; Proietti, Guido
Range augmentation problems in static ad-hoc wireless networks
2005-01-01 Bilò, D.; Proietti, Guido
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
2006-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Dynamic Mechanism Design
2006-01-01 Bilo', D.; Guala', L.; Proietti, Guido
On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem
2006-01-01 Bilò, D.; L., Gualà; Proietti, Guido
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks
2006-01-01 Bilò, D.; Proietti, Guido
Locating Facilities on a Network to Minimize their Average Service Radius
2007-01-01 Bilò, D.; J., Derungs; L., Gualà; Proietti, Guido; P., Widmayer
An Algorithm Composition Scheme Preserving Monotonicity
2007-01-01 Bilò, D.; Forlizzi, Luca; L., Gualà; Proietti, Guido
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems
2007-01-01 Bilò, D.; Forlizzi, Luca; Gualà, L.; Proietti, G.
Discovery of network properties with all-shortest-paths queries
2008-01-01 Bilò, Davide; Erlebach, T.; Mihalak, M.; Widmayer, P.
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems
2008-01-01 Bilò, D.; Forlizzi, Luca; L., Gualà; Proietti, Guido
Reoptimization of steiner trees
2008-01-01 Bilò, Davide; Bockenhauer, H. -J.; Hromkovic, J.; Kralovic, R.; Momke, T.; Widmayer, P.; Zych, A.
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game
2008-01-01 Bilò, D.; L., Gualà; Proietti, Guido; P., Widmayer
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks
2008-01-01 Bilò, D.; Proietti, Guido
Approximating the Metric TSP in Linear Time
2008-01-01 Bilò, D.; Forlizzi, Luca; Proietti, Guido
Dynamic Mechanism Design
2009-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Reoptimization of the Shortest Common Superstring Problem (Extended Abstract)
2009-01-01 Bilò, Davide; Bockenhauer, H. -J.; Komm, D.; Kralovic, R.; Momke, T.; Seibert, S.; Zych, A.
Reoptimization of weighted graph and covering problems
2009-01-01 Bilò, Davide; Widmayer, P.; Zych, A.
Stability of Networks in Stretchable Graphs
2009-01-01 Bilò, D.; M., Gatto; L., Gualà; Proietti, Guido; P., Widmayer
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