Publication:4779157
From MaRDI portal
zbMath0999.68537MaRDI QIDQ4779157
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360351
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Disjoint paths in sparse graphs, Efficient algorithms for wavelength assignment on trees of rings, Call control with \(k\) rejections, Finding edge-disjoint paths in networks: an ant colony optimization algorithm