Approximation and Online Algorithms
From MaRDI portal
Publication:5898462
DOI10.1007/11671411zbMath1125.68319OpenAlexW4210634114MaRDI QIDQ5898462
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
On the hardness of network design for bottleneck routing games, Efficient methods for selfish network design, Network characterizations for excluding Braess's paradox
