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

DOI10.1109/TC.2013.163MaRDI QIDQ5267334zbMATH OpenOpenAlexFDO

Authors Jianxin Wang, Peiqiang Tan, Jinyi Yao, Qilong Feng, Jianer 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)

Cited in

(8)

• On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
• An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
• Rectilinear path problems in restricted memory setup
• Minimum-link paths revisited
• Improved FPT Algorithms for Rectilinear k-Links Spanning Path
• scientific article; zbMATH DE number 6707504 (Why is no real title available?)
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
• The cable trench problem: Combining the shortest path and minimum spanning tree problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267334)