scientific article; zbMATH DE number 1834661
From MaRDI portal
Publication:4779157
zbMath0999.68537MaRDI QIDQ4779157
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360351
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) Approximation algorithms (68W25)
Related Items
Call control with \(k\) rejections ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm ⋮ Disjoint paths in sparse graphs ⋮ Efficient algorithms for wavelength assignment on trees of rings
