![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/caan/BiloGP06
@inproceedings{DBLP:conf/caan/BiloGP06, author = {Davide Bil{\`{o}} and Luciano Gual{\`{a}} and Guido Proietti}, editor = {Thomas Erlebach}, title = {Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem}, booktitle = {Combinatorial and Algorithmic Aspects of Networking, Third Workshop, {CAAN} 2006, Chester, UK, July 2, 2006. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4235}, pages = {19--30}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11922377\_3}, doi = {10.1007/11922377\_3}, timestamp = {Thu, 23 Jun 2022 19:59:07 +0200}, biburl = {https://dblp.org/rec/conf/caan/BiloGP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.