Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9693
Title: Some new structural properties of shortest 2-connected steiner networks
Authors: Peng, S
Li, M
Zhang, S
Cheng, TCE 
Issue Date: 2007
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2007, v. 4613 LNCS, p. 317-324 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: In this paper we give a number of structural results for the problem of constructing minimum-weight 2-connected Steiner networks for a set of terminals in a graph and in the plane. A sufficient condition for a minimum-weight 2-connected Steiner network on a set of points in the plane to be basic is also obtained. Using the structural results, we show that the minimum-weight 2-connected Steiner network on a set of terminals Z is either a minimum-weight 2-connected spanning network on Z or isomorphic to one of several specific networks when |Z| = 6 or 7.
Description: 1st International Frontiers in Algorithmics Workshop, FAW 2007, Lanzhou, 1-3 August 2007
URI: http://hdl.handle.net/10397/9693
ISBN: 9783540738138
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

44
Last Week
3
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.