Pages that link to "Item:Q4225862"
From MaRDI portal
The following pages link to Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property (Q4225862):
Displaying 14 items.
- Improved algorithms for path partition and related problems (Q408433) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Speeding up dynamic programming in the line-constrained \(k\)-median (Q726094) (← links)
- Multiple sink location problems in dynamic path networks (Q897956) (← links)
- Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes (Q990126) (← links)
- Distribution-aware compressed full-text indexes (Q2017875) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Speeding up Dynamic Programming in the Line-Constrained k-median (Q2819512) (← links)
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
- (Q5091168) (← links)
- Algorithms and Data Structures (Q5394261) (← links)
- Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5918293) (← links)
- The line-constrained maximum coverage facility location problem (Q6606204) (← links)
