NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE

DOI10.1017/S1446181117000116zbMath1373.90132OpenAlexW4240170591MaRDI QIDQ5370789

Longshu Wu, Qin Wang

Publication date: 20 October 2017

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181117000116

zbMATH Keywords

spanning treeHamming distanceNP-hardpolynomial algorithmnetwork design

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• An inverse model for the most uniform problem
• On an instance of the inverse shortest paths problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Combinatorial optimization. Theory and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE