scientific article; zbMATH DE number 1182917
From MaRDI portal
Publication:4401014
zbMATH Open0907.68194MaRDI QIDQ4401014FDOQ4401014
Publication date: 2 March 1999
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38)
Cited In (24)
- Constant-Factor Approximation for TSP with Disks
- Shortest paths for line segments
- Shortest path problems with node failures
- Link-Length Minimization in Networks
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Approximation algorithms for multi-parameter graph optimization problems
- Upgrading Shortest Paths in Networks
- Maximum thick paths in static and dynamic environments
- Title not available (Why is that?)
- Path optimization with limited sensing ability
- Shortest paths in reachability graphs
- Shortest shortest path trees of a network
- Approximate distance oracles for graphs with dense clusters
- Shortest-path queries in static networks
- Network-Tree Model and Shortest Path Algorithm
- Path problems in networks
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane
- Computing shortest heterochromatic monotone routes
- Flying over a polyhedral terrain
- The traveling salesmanpProblem for lines in the plane
- Title not available (Why is that?)
- Shortest paths in networks with vector weights
- Maximal distortion of geodesic diameters in polygonal domains
- On geometric path query problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401014)
