Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
From MaRDI portal
Publication:4225862
DOI10.1006/jagm.1998.0955zbMath0916.68066OpenAlexW3136742361MaRDI QIDQ4225862
Publication date: 17 January 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1998.0955
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon ⋮ Improved algorithms for path partition and related problems ⋮ Multiple sink location problems in dynamic path networks ⋮ Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane ⋮ New algorithms for facility location problems on the real line ⋮ Shape rectangularization problems in intensity-modulated radiation therapy ⋮ Distribution-aware compressed full-text indexes ⋮ Unnamed Item ⋮ Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes ⋮ Speeding up dynamic programming in the line-constrained \(k\)-median ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ Speeding up Dynamic Programming in the Line-Constrained k-median
