Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 394721, 8 pages
http://dx.doi.org/10.1155/2012/394721
Research Article

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

Department of Computer Science, Taipei Municipal University of Education, No. 1, Ai-Guo West Road, Taipei 10048, Taiwan

Received 28 October 2011; Accepted 18 January 2012

Academic Editor: Rudong Chen

Copyright © 2012 Yen Hung Chen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. H. Chow, “On multicast path finding algorithms,” in Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies (IEEE INFOCOM '91), vol. 3, pp. 1274–1283, Bal Harbour, Fla, USA, 1991.
  2. A. Goel, K. G. Ramakrishnan, D. Kataria, and D. Logothetis, “Efficient computation of delay-sensitive routes from one source to all destinations,” in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 854–858, Anchorage, Alaska, USA, 2001.
  3. B. Kadaba and J. Jaffe, “Routing to multiple destinations in computer networks,” IEEE Transactions on Communications, vol. 31, pp. 343–351, 1983. View at Google Scholar
  4. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, “Multicasting for multimedia applications,” IEEE/ACM Transactions on Networking, pp. 286–292, 1993. View at Google Scholar
  5. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt, III, “Bicriteria network design problems,” Journal of Algorithms, vol. 28, no. 1, pp. 142–171, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. Z. Wang, “On the complexity of quality of service routing,” Information Processing Letters, vol. 69, no. 3, pp. 111–114, 1999. View at Publisher · View at Google Scholar
  7. V. Aggarwal, Y. P. Aneja, and K. P. K. Nair, “Minimal spanning tree subject to a side constraint,” Computers and Operations Research, vol. 9, no. 4, pp. 287–296, 1982. View at Google Scholar
  8. R. Hassin and A. Levin, “An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection,” SIAM Journal on Computing, vol. 33, no. 2, pp. 261–268, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. S.-P. Hong, S.-J. Chung, and B. K. Park, “A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem,” Operations Research Letters, vol. 32, no. 3, pp. 233–239, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. R. Ravi and M. Goemans, “The constrained minimum spanning tree problem,” in Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, vol. 1097 of Lecture Notes in Computer Science, pp. 66–75, 1996.
  11. P. Chalasani and R. Motwani, “Approximating capacitated routing and delivery problems,” SIAM Journal on Computing, vol. 28, no. 6, pp. 2133–2149, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, USA, 1998, A Wiley-Interscience Publication.
  13. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, New York, NY, USA, 1976.
  14. R. Hassin, “Approximation schemes for the restricted shortest path problem,” Mathematics of Operations Research, vol. 17, no. 1, pp. 36–42, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. D. H. Lorenz and D. Raz, “A simple efficient approximation scheme for the restricted shortest path problem,” Operations Research Letters, vol. 28, no. 5, pp. 213–219, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. G. Xue, W. Zhang, J. Tang, and K. Thulasiraman, “Polynomial time approximation algorithms for multi-constrained QoS routing,” IEEE/ACM Transactions on Networking, vol. 16, pp. 656–669, 2008. View at Google Scholar
  17. F. Ergun, R. Sinha, and L. Zhang, “An improved FPTAS for restricted shortest path,” Information Processing Letters, vol. 83, no. 5, pp. 287–291, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. G. Chen and G. Xue, “K-pair delay constrained minimum cost routing in undirected networks,” in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01), pp. 230–231, SIAM, Washington, DC, USA,, 2001.
  19. G. Chen and G. Xue, “A PTAS for weight constrained Steiner trees in series-parallel graphs,” Theoretical Computer Science, vol. 304, no. 1–3, pp. 237–247, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press, Cambridge, Mass, USA, 2nd edition, 2001.