Google Research

Shortest anisotropic paths with few bends is NP-complete

Mustaq Ahmed
Anna Lubiw
The 18th Fall Workshop on Computational Geometry (FWCG): Abstracts, Rensselaer Polytechnic Institute, Troy, New York (2008), pp. 28-29
Google Scholar

Abstract

Research Areas

×