Network design for minimum spanning trees under Hamming distance

DOI10.1017/S1446181117000116MaRDI QIDQ5370789zbMATH OpenOpenAlexFDO

Authors Qin Wang, Longshu Wu

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

Hamming distancenetwork designNP-hardpolynomial algorithmspanning tree

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Weighted inverse minimum spanning tree problems under Hamming distance
• Inverse constrained minimum spanning tree problem under Hamming distance
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Inverse cost limit of constrained minimum spanning tree problem under Hamming distance

Cites work

• [article; zbMATH DE number 1341907 (Why is no real title available?)]
• [article; zbMATH DE number 1086909 (Why is no real title available?)]
• [article; zbMATH DE number 2203240 (Why is no real title available?)]
• An inverse model for the most uniform problem
• Combinatorial optimization. Theory and algorithms
• Inverse combinatorial optimization: a survey on problems, methods, and results
• On an instance of the inverse shortest paths problem

Cited in

(2)

• Tree embeddings for hop-constrained network design
• Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network

This page was built for publication: Network design for minimum spanning trees under Hamming distance

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