Random shortest paths: non-Euclidean instances for metric optimization problems

DOI10.1007/S00453-014-9901-9MaRDI QIDQ6826663zbMATH OpenFDO

Authors Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao

Publication date 3 September 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-014-9901-9

zbMATH Keywords

approximation algorithmsfirst passage percolationrandom metricsrandom shortest paths

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Random shortest paths: non-Euclidean instances for metric optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826663)