On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms

DOI10.1109/TC.2013.163zbMath1364.68235OpenAlexW2053491405MaRDI QIDQ5267334

Peiqiang Tan, Qilong Feng, Jianxin Wang, Jinyi Yao, Jian'er Chen

Publication date: 20 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2013.163

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs

This page was built for publication: On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms