A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. First, an exact pseudo-polynomial algorithm is developed based on a two-variable extension of the well-known matrix-tree theorem. The scaling and approximate binary search techniques are then uti...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 32; no. 3; pp. 233 - 239
Main Authors Hong, Sung-Pil, Chung, Sung-Jin, Park, Bum Hwan
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.2004
Subjects
Bicriteria approximation
Fully polynomial approximation scheme
Matrix-tree theorem
Spanning tree
Fully polynomial approximation scheme
Matrix-tree theorem
Bicriteria approximation
Spanning tree
Online AccessGet full text
ISSN0167-6377
1872-7468
DOI10.1016/j.orl.2003.06.003

Cover

More Information
Summary:We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. First, an exact pseudo-polynomial algorithm is developed based on a two-variable extension of the well-known matrix-tree theorem. The scaling and approximate binary search techniques are then utilized to yield a fully polynomial approximation scheme.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2003.06.003