Results 11 to 20 of about 130,220 (362)
Covering Paths and Trees for Planar Grids [PDF]
, 2013 Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid.
Balázs Keszegh
openalex +5 more sources
Generalizing the Covering Path Problem on a Grid [PDF]
, 2019 We study the covering path problem on a grid of R^{2}. We generalize earlier results on a rectangular grid and prove that the covering path cost can be bounded by the area and perimeter of the grid. We provide (2+ ) and (1+ )-approximations for the problem on a general grid and on a convex grid, respectively.
Liwei Zeng +2 more
openalex +3 more sources
On paths in grids with forbidden transitions
, 2015 Une transition dans un graphe est une paire d'arêtes incidentes à un même sommet. Etant donnés un graphe G = (V, E), deux sommets s,t ∈ V et un ensemble associé de transitions interdites F ⊆ E × E, le problème de chemin évitant des transitions interdites consiste à décider s'il existe un chemin élémentaire de s à t qui n'utilise aucune des transitions ...
Mamadou Moustapha Kanté +3 more
openalex +3 more sources
Shortest Disjoint Paths on a Grid
ACM-SIAM Symposium on Discrete AlgorithmsMathieu Mari +3 more
semanticscholar +2 more sources
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary
International Colloquium on Automata, Languages and Programming, 2018 Julia Chuzhoy +2 more
openalex +3 more sources
Vertex Contact Representations of Paths on a Grid [PDF]
Journal of Graph Algorithms and Applications, 2015 We study Vertex Contact representations of Paths on a Grid (VCPG). In such a representation, the vertices of G are represented by a family of interiorly disjoint grid-paths on a square grid. Adjacencies are represented by contacts between an endpoint of one grid-path and an interior point of another grid-path.
Aerts, Nieke, Felsner, Stefan
openaire +1 more source
TOWARDS PEDESTRIAN ACCESSIBILITY ANALYSIS IN INDOOR ENVIRONMENTS WITH CROWDS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2023 Except in emergency cases, indoor crowds could also decrease the walking speed of pedestrians in daily life. To investigate daily-based accessibility of locations to a pedestrian in the presence of crowds, this paper proposes a method of indoor ...
L. Liu, S. Zlatanova
doaj +1 more source
Discrete Optimization: The Case of Generalized BCC Lattice
Mathematics, 2021 Recently, operations research, especially linear integer-programming, is used in various grids to find optimal paths and, based on that, digital distance.
Gergely Kovács +4 more
doaj +1 more source
Almost polynomial hardness of node-disjoint paths in grids [PDF]
Symposium on the Theory of Computing, 2017 In the classical Node-Disjoint Paths (NDP) problem, we are given an n-vertex graph G=(V,E), and a collection M={(s1,t1),…,(sk,tk)} of pairs of its vertices, called source-destination, or demand pairs.
Julia Chuzhoy +2 more
semanticscholar +1 more source
ISPRS International Journal of Geo-Information, 2023 Calculating the least-cost path (LCP) is a fundamental operation in raster-based geographic information systems (GIS). The LCP is applied to raster cost surfaces, in which it determines the most cost-effective path.
Qiuling Tang, Wanfeng Dou
doaj +1 more source