IRIS

Sfoglia per Autore  

Opzioni
Mostrati risultati da 1 a 20 di 70
Data di pubblicazione Titolo Autore(i) Tipo File
1-gen-2005 A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals Guala', L; Proietti, G Intervento a convegno
1-gen-2005 Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem Guala', L; Proietti, G Intervento a convegno
1-gen-2006 On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem Bilò, D; Guala', L; Proietti, G Intervento a convegno
1-gen-2006 Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem Bilò, D; Guala', L; Proietti, G Intervento a convegno
1-gen-2006 Dynamic Mechanism Design Bilò, D; Guala', L; Proietti, G Intervento a convegno
1-gen-2007 An algorithm composition scheme preserving monotonicity Bilò, D; Forlizzi, L; Guala', L; Proietti, G Intervento a convegno
1-gen-2007 Locating Facilities on a Network to Minimize Their Average Service Radius Bilò, D; Derungs, J; Guala', L; Proietti, G; Widmayer, P Intervento a convegno
1-gen-2007 Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems Bilò, D; Forlizzi, L; Guala', L; Proietti, G Intervento a convegno
1-gen-2007 Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem Guala', L; Proietti, G Articolo su rivista
1-gen-2008 Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems Bilò, D; Forlizzi, L; Guala', L; Proietti, G Articolo su rivista
1-gen-2008 Computational aspects of a 2-player Stackelberg shortest paths tree game Bilò, D; Guala', L; Proietti, G; Widmayer, P Intervento a convegno
1-gen-2009 Dynamic mechanism design Bilò, D; Guala', L; Proietti, G Articolo su rivista
1-gen-2009 Stability of Networks in Stretchable Graphs Bilò, D; Gatto, M; Guala', L; Proietti, G; Widmayer, P Intervento a convegno
1-gen-2009 On Stackelberg Pricing with Computationally Bounded Consumers Briest, P; Hoefer, M; Guala', L; Ventre, C Intervento a convegno
1-gen-2010 Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree Bilò, D; Guala', L; Proietti, G Intervento a convegno
1-gen-2010 Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game Bilò, D; Guala', L; Leucci, S; Proietti, G Intervento a convegno
1-gen-2010 Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems Bilò, D; Guala', L; Proietti, G Intervento a convegno
1-gen-2011 Network Verification via Routing Table Queries Bampas, E; Bilò, D; Drovandi, G; Guala', L; Klasing, R; Proietti, G Intervento a convegno
1-gen-2012 Bounded-Distance Network Creation Games Bilò, D; Guala', L; Proietti, G Intervento a convegno
1-gen-2012 On stackelberg pricing with computationally bounded customers Briest, P; Guala', L; Hoefer, M; Ventre, C Articolo su rivista
Mostrati risultati da 1 a 20 di 70
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