Optimal facility location problem on polyhedral terrains using descending paths

DOI10.1016/j.tcs.2020.09.037zbMath1467.68197OpenAlexW3089175208MaRDI QIDQ2210515

Binayak Dutta, Arindam Karmakar, Sasanka Roy

Publication date: 6 November 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.09.037

zbMATH Keywords

facility locationdirected treespolyhedral terraindescending pathdemand points

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near optimal algorithm for the shortest descending path on the surface of a convex terrain
• Shortest monotone descent path problem in polyhedral terrain
• Approximation algorithms for shortest descending paths in terrains
• Shortest descending paths through given faces
• Trekking in the alps without freezing or getting tired
• An improved algorithm for the shortest descending path on a convex terrain
• Shortest paths on polyhedral surfaces and terrains
• Analytical approach to parallel repetition
• Navigating Weighted Regions with Scattered Skinny Tetrahedra
• Approximate Shortest Descending Paths

This page was built for publication: Optimal facility location problem on polyhedral terrains using descending paths