Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
From MaRDI portal
Recommendations
Cited in
(17)- Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
- Distribution-aware compressed full-text indexes
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
- Speeding up dynamic programming in the line-constrained \(k\)-median
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- Improved algorithms for path partition and related problems
- scientific article; zbMATH DE number 910897 (Why is no real title available?)
- Capacitated dynamic programming: faster knapsack and graph algorithms
- New algorithms for facility location problems on the real line
- Shape rectangularization problems in intensity-modulated radiation therapy
- Algorithms and Data Structures
- Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
- The line-constrained maximum coverage facility location problem
- Speeding up dynamic programming in the line-constrained k-median
- Multiple sink location problems in dynamic path networks
- Minimum \(L_k\) path partitioning-an illustration of the Monge property
- Finding the maximum bounded intersection of k out of n halfplanes
This page was built for publication: Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225862)
