Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

Yen Hung Chen

Journal of Applied Mathematics, 2012, vol. 2012, 1-8

Abstract:

Let G = ( V , E ) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B . In this paper, we present two polynomial time approximation schemes (PTASs) for the constrained minimum spanning tree problem.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2012/394721.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2012/394721.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:394721

DOI: 10.1155/2012/394721

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().