scientific article; zbMATH DE number 5790346

zbMath1216.68126MaRDI QIDQ4929402

Apichat Heednacram, Francis Suraweera, Vladimir Estivill-Castro

Publication date: 22 September 2010

Full work available at URL: http://www.jucs.org/jucs_16_5/np_completeness_and_ftp

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational geometryparameterized complexityrestricted orientations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ Covering paths for planar point sets

This page was built for publication: