HEAL DSpace

The 1-steiner tree problem

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Georgakopoulos, G en
dc.contributor.author Papadimitriou, CH en
dc.date.accessioned 2014-03-01T01:07:00Z
dc.date.available 2014-03-01T01:07:00Z
dc.date.issued 1987 en
dc.identifier.issn 0196-6774 en
dc.identifier.uri http://hdl.handle.net/123456789/9728
dc.relation.uri http://www.scopus.com/inward/record.url?eid=2-s2.0-0042014522&partnerID=40&md5=cdbc1a85942ca6a4715ac2aa578ff6ee en
dc.subject.classification Computer Science, Theory & Methods en
dc.subject.classification Mathematics, Applied en
dc.title The 1-steiner tree problem en
heal.type journalArticle en
heal.language English en
heal.publicationDate 1987 en
heal.abstract We present an O(n2) algorithm for finding the point on the plane which, if added to a given set of n points, will result in the shortest possible spanning tree. © 1987. en
heal.publisher ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS en
heal.journalName Journal of Algorithms en
dc.identifier.isi ISI:A1987G163100009 en
dc.identifier.volume 8 en
dc.identifier.issue 1 en
dc.identifier.spage 122 en
dc.identifier.epage 130 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record