Author:
Bilò Davide,Gualà Luciano,Proietti Guido
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. S. Alstrup, J. Holm, K. de Lichtenberg, M. Thorup, Minimizing diameters of dynamic trees, in: Proc. 24th International Colloquium on Automata Languages and Programming, ICALP’97, in: Lecture Notes in Computer Science, vol. 1256, Springer-Verlag, pp. 270–280
2. A. Archer, É Tardos, Truthful mechanisms for one-parameter agents, in: Proc. 42nd IEEE Symp. on Foundations of Computer Science, FOCS’01, 2001, pp. 482–491
3. On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem;Bilò,2006
4. P. Briest, P. Krysta, B. Vöcking, Approximation techniques for utilitarian mechanism design, in: Proc. 37th Ann. ACM Symp. on Theory of Computing, STOC’05, 2005, pp. 39–48
5. Data structures for on-line updating of minimum spanning trees, with applications;Frederickson;SIAM J. Comput.,1985