scientific article; zbMATH DE number 2080232
From MaRDI portal
Publication:4472476
zbMath1044.68693MaRDI QIDQ4472476
Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Prosenjit Bose, Evangelos Kranakis, Leszek Gąsieniec, Danny Krizanc
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690023.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
Approximation algorithm for hotlink assignment in the greedy model ⋮ Approximate hotlink assignment ⋮ On the complexity of optimal hotlink assignment ⋮ Optimal approximability of bookmark assignments ⋮ Max-stretch reduction for tree spanners ⋮ Dynamic hotlinks ⋮ Optimal key systems ⋮ Near-entropy hotlink assignments
This page was built for publication:
