Minimum Manhattan network is NP-complete

DOI10.1145/1542362.1542429MaRDI QIDQ5370740zbMATH OpenOpenAlexWikidataFDO

Authors Zeyu Guo, He Sun, Francis Y. L. Chin

Publication date 20 October 2017

Published in Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10722/145068

zbMATH Keywords

3-SATminimum Manhattan networkNP-complete

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Minimum Manhattan network is NP-complete
• The transitive minimum Manhattan subnetwork problem in 3 dimensions
• A fixed-parameter algorithm for the minimum Manhattan network problem
• A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
• Approximating the generalized minimum Manhattan network problem

Cited in

(5)

• Searching for realizations of finite metric spaces in tight spans
• A fixed-parameter algorithm for the minimum Manhattan network problem
• scientific article; zbMATH DE number 1332659 (Why is no real title available?)
• Minimum Manhattan network is NP-complete
• The transitive minimum Manhattan subnetwork problem in 3 dimensions

This page was built for publication: Minimum Manhattan network is NP-complete

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