Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Computing Shortest Paths in the Plane with Removable Obstacles
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Dimensional Linear Programming with Violations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON GEOMETRIC PATH QUERY PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Shortest Paths amid Convex Pseudodisks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Shortest Paths among Curved Obstacles in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for computing visibility graphs of polygonal obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing shortest paths with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path problem with uncertain arc lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar rectilinear shortest path computation using corridors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic minimum spanning trees in euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear paths among rectilinear obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric optimization with few violated constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-violation linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear Path Problems among Rectilinear Obstacles Revisited / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8831/pdf/LIPIcs-SWAT-2018-5.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2810759650 / rank
 
Normal rank
Property / title
 
Computing Shortest Paths in the Plane with Removable Obstacles (English)
Property / title: Computing Shortest Paths in the Plane with Removable Obstacles (English) / rank
 
Normal rank

Latest revision as of 11:40, 30 July 2024

scientific article; zbMATH DE number 7238960
Language Label Description Also known as
English
Computing Shortest Paths in the Plane with Removable Obstacles
scientific article; zbMATH DE number 7238960

    Statements

    0 references
    0 references
    0 references
    0 references
    25 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Euclidean shortest paths
    0 references
    removable polygonal obstacles
    0 references
    stochastic shortest paths
    0 references
    \(L_1\) shortest paths
    0 references
    0 references
    0 references
    0 references
    Computing Shortest Paths in the Plane with Removable Obstacles (English)
    0 references