×

zbMATH — the first resource for mathematics

Logarithmic hardness of the undirected edge-disjoint paths problem. (English) Zbl 1326.68143

MSC:
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C38 Paths and cycles
68Q25 Analysis of algorithms and problem complexity
68W25 Approximation algorithms
90B10 Deterministic network models in operations research
PDF BibTeX XML Cite
Full Text: DOI