51 citations · 228 across the 23 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Improved Approximation Schemes for the Restricted Shortest Path Problem
David Holzmüller
The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hard bicriteria optimization problem on graphs with vertices…
cs.CG2017★ 4 cited
Efficient Neighbor-Finding on Space-Filling Curves
David Holzmüller
Space-filling curves (SFC, also known as FASS-curves) are a useful tool in scientific computing and other areas of computer science to sequentialize multidimensional grids in a cac…