Publications

Detailed Information

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

DC Field Value Language
dc.contributor.authorHong, Sung-Pil-
dc.contributor.authorChung, Sung-Jin-
dc.contributor.authorPark, Bum Hwan-
dc.date.accessioned2009-07-10T07:55:29Z-
dc.date.available2009-07-10T07:55:29Z-
dc.date.issued2003-10-10-
dc.identifier.citationOper. Res. Lett. 32 (3) (2004) 233-239en
dc.identifier.issn0167-6377-
dc.identifier.urihttps://hdl.handle.net/10371/5347-
dc.description.abstractWe 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.en
dc.language.isoen-
dc.publisherElsevieren
dc.subjectSpanning treeen
dc.subjectBicriteria approximationen
dc.subjectFully polynomial approximation schemeen
dc.subjectMatrix-tree theoremen
dc.titleA fully polynomial bicriteria approximation scheme for the constrained spanning tree problemen
dc.typeArticleen
dc.contributor.AlternativeAuthor홍성필-
dc.contributor.AlternativeAuthor정성진-
dc.contributor.AlternativeAuthor박범환-
dc.identifier.doi10.1016/j.orl.2003.06.003-
dc.identifier.doi10.1016/j.orl.2003.06.003-
dc.citation.journaltitleOperations Research Letters-
Appears in Collections:
Files in This Item:
There are no files associated with this item.

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share