Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance

Theoretical Computer Science

Volumn 396, Issue 1-3, 2008, Pages 28-34

  Liu, Longcheng ^a   Yao, Enyu ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Hamming distance; Inverse problem; Min max spanning tree; Strongly polynomial algorithms

Indexed keywords

ALGORITHMS; HAMMING DISTANCE; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

FEASIBLE SOLUTION; INVERSE OPTIMIZATION PROBLEM; MIN-MAX SPANNING TREE; OPTIMAL SOLUTION; POLYNOMIAL ALGORITHMS;

INVERSE PROBLEMS;

EID: 42149147570     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.12.006     Document Type: Article

References (10)

1. Camerini P.M. The min-max spanning tree problem and some extensions. Information Processing Letters 7 (1978) 10-14
2. ∞ norms with bound constraints on changes. Journal of Combinatorial Optimization 13 (2007) 123-135
3. Heuberger C. Inverse optimization: A survey on problems, methods, and results. Journal of Combinatorial Optimization 8 (2004) 329-361
4. He Y., Zhang B.W., and Yao E.Y. Weighted inverse minimum spanning tree problems under Hamming distance. Journal of Combinatorial Optimization 9 (2005) 91-100
5. He Y., Zhang B.W., and Zhang J.Z. Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. Journal of Global Optimization 34 3 (2006) 47-474
6. Zhang B.W., Zhang J.Z., and He Y. The center location improvement problem under the Hamming distance. Journal of Combinatorial Optimization 9 (2005) 187-198
7. Yang X.G., and Zhang J.Z. Some New Results on Inverse Sorting Problems. Lecture Notes in Computer Science vol. 3595 (2005) 985-992
8. Liu L.C., and Zhang J.Z. Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization 12 (2006) 395-408
9. Liu L.C., and Yao E.Y. Weighted inverse minimum cut problem under the bottleneck type Hamming distance. Asia-Pacific Journal of Operational Research 24 5 (2007) 725-736
10. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows (1993), Prentice-Hall, Englewood Cliffs