Computing and Combinatorics
From MaRDI portal
Publication:5716957
DOI10.1007/11533719zbMath1128.68556MaRDI QIDQ5716957
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
90B18: Communication networks in operations research
68R10: Graph theory (including graph drawing) in computer science
68W25: Approximation algorithms
Related Items
Dynamic mechanism design, Strongly polynomial-time truthful mechanisms in one shot, Strategyproof auction mechanisms for network procurement, Exact and approximate truthful mechanisms for the shortest paths tree problem