Constant Factor Approximations for the Hotlink Assignment Problem

DOI10.1007/978-3-540-73951-7_17zbMath1209.68036OpenAlexW2137091452MaRDI QIDQ3603526

Tobias Jacobs

Publication date: 17 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_17

zbMATH Keywords

dynamic programminggraph theoryapproximation algorithmsgreedy algorithmshotlink assignment

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Internet topics (68M11)

Related Items (2)

On the complexity of optimal hotlink assignment ⋮ Resource Management in Large Networks

This page was built for publication: Constant Factor Approximations for the Hotlink Assignment Problem