Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

INVERSE CONSTRAINED MINIMUM SPANNING TREE PROBLEM UNDER HAMMING DISTANCE

  • Jiao, Li (Department of Mathematics Shenyang Normal University) ;
  • Tang, Heng-Young (Department of Mathematics Shenyang Normal University)
  • Published : 2010.01.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

Keywords

References

  1. R. K. Ahuja, T.L. Magnanti, and J. B. Orlin , Network Flows: Theory, Algorithms, and Application, Prentice Hall: Englewood Cliffs, NJ, 1993.
  2. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
  3. R. Motwani, Approximation Algorithms, Lecture Notes, Stanford University, Stanford, 2000.
  4. Hochbaum DS. Efficient algorithms for the inverse spanning tree problem. Operations Research 2003; 51: 785-97. https://doi.org/10.1287/opre.51.5.785.16756
  5. Ahuja RK, Orlin JB, Inverse optimization, part i: Linear programming and general problem, Oper Res 2001; 35: 771-783.
  6. Heuburger C, nverse optimization, a survey on problems, methods, and results, J Comb Optim, 2004, 361.
  7. Orlin JB, lnverse optimization and partial inverse optimization, PPT presentation on Optimization Day Columbia University November 3 2003.
  8. He Y, Zhang B, Yao E, Weighted inverse minimum spanning tree problems under Hamming distance, J Comb Optim 2005; 9: 91-100. https://doi.org/10.1007/s10878-005-5486-1
  9. Kruskal J.B., On the shortest spanning subtree of a gmph and the traveling salesman problem, Proceedings of the AMS 1956; 7: 48-50. https://doi.org/10.1090/S0002-9939-1956-0078686-7