DBScholar

Back to papers

Constrained Shortest Path Finding on Terrain Surfaces

Summary: Introduces CPTS: the shortest path over a terrain surface from s to t visiting all specified POIs, proving NP-hardness. Develops a 2(1+ε)-approximation with O(kN log²N/(ε²β)) time and O(k/(ε²β)) space, outperforming baselines. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
7404
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,213 | 29.93%
DOI
10.1145/3802031

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{wei_sigmod26,
        title = {{Constrained Shortest Path Finding on Terrain Surfaces}},
        author = {Wei, Victor Junqiu and Xie, Min and Wang, Weicheng},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802031},
        url = {https://dl.acm.org/doi/10.1145/3802031},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers