Inverse cost limit of constrained minimum spanning tree problem under Hamming distance

MaRDI QIDQ3164681zbMATH OpenFDO

Authors Li Jiao, Yang Liu, Heng-Yong Tang

Publication date 5 November 2010

zbMATH Keywords

Hamming distanceinverse constrained minimum spanning tree problem

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• Inverse constrained minimum spanning tree problem under Hamming distance
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Weighted inverse minimum spanning tree problems under Hamming distance

Cited in

(6)

• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Inverse constrained minimum spanning tree problem under Hamming distance
• Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
• Network design for minimum spanning trees under Hamming distance

This page was built for publication: Inverse cost limit of constrained minimum spanning tree problem under Hamming distance

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