Algorithms and Computation

DOI10.1007/11602613zbMath1175.68027OpenAlexW2304246803MaRDI QIDQ5897913

Christos Kaklamanis, Ioannis Caragiannis, Clemente Galdi

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43)

Related Items (6)

Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ Bottleneck Routing with Elastic Demands ⋮ On the hardness of network design for bottleneck routing games ⋮ Bottleneck routing with elastic demands ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Bottleneck links, variable demand, and the tragedy of the commons

This page was built for publication: Algorithms and Computation