Sfoglia per Autore
Augmenting the Edge-Connectivity of a Spider Tree
2004-01-01 Bilò, Davide; Proietti, Guido
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs
2005-01-01 Bilò, Davide; Proietti, Guido
Range Augmentation Problems in Static Ad-Hoc Wireless Networks
2005-01-01 Bilò, Davide; Proietti, Guido
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path
2005-01-01 Bilò, Davide; Proietti, Guido
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks
2006-01-01 Bilò, Davide; Proietti, Guido
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
2006-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
2006-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Dynamic Mechanism Design
2006-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Locating Facilities on a Network to Minimize Their Average Service Radius
2007-01-01 Bilò, Davide; Derungs, Jörg; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
An algorithm composition scheme preserving monotonicity
2007-01-01 Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems
2007-01-01 Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido
Reoptimization of Weighted Graph and Covering Problems
2008-01-01 Bilò, Davide; Widmayer, Peter; Zych, Anna
Reoptimization of Steiner Trees
2008-01-01 Bilò, Davide; BÖCKENHAUER HANS, Joachim; Hromkovic, Juraj; Královic, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game
2008-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
Approximating the Metric TSP in Linear Time
2008-01-01 Bilò, Davide; Forlizzi, Luca; Proietti, Guido
Approximate mechanisms for the graphical TSP and other graph-traversal problems
2008-01-01 Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido
On the complexity of minimizing interference in ad-hoc and sensor networks
2008-01-01 Bilò, Davide; Proietti, Guido
Discovery of Network Properties with All-Shortest-Paths Queries
2008-01-01 Bilò, Davide; Erlebach, Thomas; Mihalák, Matús; Widmayer, Peter
Stability of Networks in Stretchable Graphs
2009-01-01 Bilò, Davide; Gatto, Michael; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
Reconstructing Visibility Graphs with Simple Robots
2009-01-01 Bilò, Davide; Disser, Yann; Mihalák, Matus; Suri, Subash; Vicari, Elias; Widmayer, Peter
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Augmenting the Edge-Connectivity of a Spider Tree | 1-gen-2004 | Bilò, Davide; Proietti, Guido | |
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs | 1-gen-2005 | Bilò, Davide; Proietti, Guido | |
Range Augmentation Problems in Static Ad-Hoc Wireless Networks | 1-gen-2005 | Bilò, Davide; Proietti, Guido | |
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path | 1-gen-2005 | Bilò, Davide; Proietti, Guido | |
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks | 1-gen-2006 | Bilò, Davide; Proietti, Guido | |
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem | 1-gen-2006 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem | 1-gen-2006 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
Dynamic Mechanism Design | 1-gen-2006 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
Locating Facilities on a Network to Minimize Their Average Service Radius | 1-gen-2007 | Bilò, Davide; Derungs, Jörg; Gualà, Luciano; Proietti, Guido; Widmayer, Peter | |
An algorithm composition scheme preserving monotonicity | 1-gen-2007 | Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido | |
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems | 1-gen-2007 | Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido | |
Reoptimization of Weighted Graph and Covering Problems | 1-gen-2008 | Bilò, Davide; Widmayer, Peter; Zych, Anna | |
Reoptimization of Steiner Trees | 1-gen-2008 | Bilò, Davide; BÖCKENHAUER HANS, Joachim; Hromkovic, Juraj; Královic, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna | |
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game | 1-gen-2008 | Bilò, Davide; Gualà, Luciano; Proietti, Guido; Widmayer, Peter | |
Approximating the Metric TSP in Linear Time | 1-gen-2008 | Bilò, Davide; Forlizzi, Luca; Proietti, Guido | |
Approximate mechanisms for the graphical TSP and other graph-traversal problems | 1-gen-2008 | Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido | |
On the complexity of minimizing interference in ad-hoc and sensor networks | 1-gen-2008 | Bilò, Davide; Proietti, Guido | |
Discovery of Network Properties with All-Shortest-Paths Queries | 1-gen-2008 | Bilò, Davide; Erlebach, Thomas; Mihalák, Matús; Widmayer, Peter | |
Stability of Networks in Stretchable Graphs | 1-gen-2009 | Bilò, Davide; Gatto, Michael; Gualà, Luciano; Proietti, Guido; Widmayer, Peter | |
Reconstructing Visibility Graphs with Simple Robots | 1-gen-2009 | Bilò, Davide; Disser, Yann; Mihalák, Matus; Suri, Subash; Vicari, Elias; Widmayer, Peter |
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