scientific article; zbMATH DE number 1302178

MaRDI QIDQ4247445zbMATH OpenFDO

Authors Danny Z. Chen

Publication date 1998

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Recommendations

• ON GEOMETRIC PATH QUERY PROBLEMS
• On geometric path query problems
• Shortest paths in the plane with convex polygonal obstacles
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• scientific article; zbMATH DE number 1962800

Cited in

(11)

• Approximation algorithms for geometric shortest path problems
• scientific article; zbMATH DE number 1962800 (Why is no real title available?)
• Searching shortest paths on a set of geometric objects
• Fundamentals of Computation Theory
• Space-efficient algorithms for reachability in directed geometric graphs
• Efficient Algorithms for Geometric Graph Search Problems
• Evaluating geometric queries using few arithmetic operations
• Geometric k Shortest Paths
• On geometric path query problems
• ON GEOMETRIC PATH QUERY PROBLEMS
• Efficient computation of geodesic shortest paths

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 Q4247445)