Computing Shortest Paths Amid Non-overlapping Weighted Disks
Sign Up to like & getrecommendations! Published in 2024 at "Results in Mathematics"
DOI: 10.1007/s00025-025-02479-2
Abstract: In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of n non-overlapping weighted disks in the plane. For a given parameter ε∈(0,1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy}… read more here.
Keywords: non overlapping; document; overlapping weighted; usepackage ... See more keywords