Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68556OpenAlexW4376561447MaRDI QIDQ5716957

Guido Proietti, Luciano Gualà

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

zbMATH Keywords

Steiner Tree ProblemAlgorithmic Mechanism DesignApproximate Truthful MechanismsSelfish Agents

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (4)

Strategyproof auction mechanisms for network procurement ⋮ Exact and approximate truthful mechanisms for the shortest paths tree problem ⋮ Dynamic mechanism design ⋮ Strongly polynomial-time truthful mechanisms in one shot

This page was built for publication: Computing and Combinatorics