Finding the Minimum-Weight k-Path
From MaRDI portal
Publication:2842177
DOI10.1007/978-3-642-40104-6_34zbMath1390.68347arXiv1307.2415OpenAlexW1823520861MaRDI QIDQ2842177
Liam Roditty, Avinatan Hassidim, Orgad Keller, Moshe Lewenstein
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.2415
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
This page was built for publication: Finding the Minimum-Weight k-Path
