Network Expansion Problem on the Spanning Tree in Graphs

Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the underlying structure of the networks unchanged. In this paper we propose the general network expansion problem on the spanning tree in graphs (GNEST),...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 WRI World Congress on Computer Science and Information Engineering : March 31, 2009-April 2, 2009 Ročník 2; s. 691 - 695
Hlavní autoři: Jianping Li, Juanping Zhu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.03.2009
Témata:
Algorithm design and analysis
Approximation algorithms
Computational complexity
Computer science
Costs
IP networks
Mathematics
network expansion
Polynomials
spanning tree
strongly
Transportation
Tree graphs
ISBN:9780769535074, 0769535070
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the underlying structure of the networks unchanged. In this paper we propose the general network expansion problem on the spanning tree in graphs (GNEST), then we present the polynomial equivalence between the GNEST problem and the constrained minimum spanning tree problem (CST), which indicates the GNEST problem is NP-hard. By utilizing an algorithm to solve the CST problem, we can design a PTAS to solve the GNEST problem, and the computational complexity is the same as that of the algorithm given in. Finally we study two special versions of the GNEST problem:the minimum network expansion on spanning tree problem (MNEST) and the minimum-cost network expansion on spanning tree (MCNEST). We design two polynomial-time algorithms to solve these two new problems. To solve the MNEST problem we use T-exchange method on spanning trees. To find the optimal solution of the MCNEST problem, we utilize lexicographical order and modify Sollinpsilas algorithm to find the minimum spanning tree as required.
AbstractList Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the underlying structure of the networks unchanged. In this paper we propose the general network expansion problem on the spanning tree in graphs (GNEST), then we present the polynomial equivalence between the GNEST problem and the constrained minimum spanning tree problem (CST), which indicates the GNEST problem is NP-hard. By utilizing an algorithm to solve the CST problem, we can design a PTAS to solve the GNEST problem, and the computational complexity is the same as that of the algorithm given in. Finally we study two special versions of the GNEST problem:the minimum network expansion on spanning tree problem (MNEST) and the minimum-cost network expansion on spanning tree (MCNEST). We design two polynomial-time algorithms to solve these two new problems. To solve the MNEST problem we use T-exchange method on spanning trees. To find the optimal solution of the MCNEST problem, we utilize lexicographical order and modify Sollinpsilas algorithm to find the minimum spanning tree as required.
Author Juanping Zhu
Jianping Li
Author_xml – sequence: 1
  surname: Jianping Li
  fullname: Jianping Li
  organization: Dept. of Math., Yunnan Univ., Kunming, China
– sequence: 2
  surname: Juanping Zhu
  fullname: Juanping Zhu
  organization: Dept. of Math., Yunnan Univ., Kunming, China
BookMark eNotjM1Kw0AYABdUUNscPXnZF0j89j97lBDbQtFCcy-b5ItdbTdhN6C-vQU9zTCHuSfXYQxIyAODgjGwT9V-UxccwBZC6CuSWVOC0VYJBUbekiylDwBgVhtl9B0pX3H-GuMnrb8nF5IfA93FsT3hmV50PiLdX3rw4Z02EZH6QFfRTce0JDeDOyXM_rkgzUvdVOt8-7baVM_b3FuY8xaE6kTvNAdURlqUA3DsWK8kG8p2QGYUmp6h7F3btdo5yTvn9GC41chBLMjj39Yj4mGK_uziz0ExwyQvxS-AUUZj
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CSIE.2009.336
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
Accès Toulouse INP et ENVT - IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EndPage 695
ExternalDocumentID 5171428
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-b035c3da620e5749e4f02ec1d541f8bfe175e7d1e4dabcb6aa42caa6f7296e203
IEDL.DBID RIE
ISBN 9780769535074
0769535070
IngestDate Wed Aug 27 02:11:36 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-b035c3da620e5749e4f02ec1d541f8bfe175e7d1e4dabcb6aa42caa6f7296e203
PageCount 5
ParticipantIDs ieee_primary_5171428
PublicationCentury 2000
PublicationDate 2009-March
PublicationDateYYYYMMDD 2009-03-01
PublicationDate_xml – month: 03
  year: 2009
  text: 2009-March
PublicationDecade 2000
PublicationTitle 2009 WRI World Congress on Computer Science and Information Engineering : March 31, 2009-April 2, 2009
PublicationTitleAbbrev CSIE
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001967576
Score 1.4173316
Snippet Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the...
SourceID ieee
SourceType Publisher
StartPage 691
SubjectTerms Algorithm design and analysis
Approximation algorithms
Computational complexity
Computer science
Costs
IP networks
Mathematics
network expansion
Polynomials
spanning tree
strongly
Transportation
Tree graphs
Title Network Expansion Problem on the Spanning Tree in Graphs
URI https://ieeexplore.ieee.org/document/5171428
Volume 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LawIxEB5Uemgvtmrpmxx67NbsbpLNnsU-oBVBKd4kjwl4UfFR-vOb7G7XHnrpbRJCCBmSTObxfQD3zEmKnKaRc8xFTGrl78HURk5JyTVTVBU42x9v2WgkZ7N83ICHuhYGEYvkM3wMYhHLtyuzD66yPg9s3YlsQjPLRFmrdfCn5N70zUT5M8956u2cCtKpbrMDxmZ_MHkdlmiVaUBn_sWsUjwsT-3_LekUeocKPTKu354zaOCyA-0figZSndgOnLzXsKzbLshRmfRNhl_-Egh-sjBJIJQhXvQDyWRdchiR6QaRLJbkOQBab3swfRpOBy9RRZ0QLXK6izRNuUmtEolXRMZyZI4maGLLWeykduiNBsxsjMwqbbRQiiVGKeG8qS0woek5tJarJV4A0XFiHXIjEp0zYZ0SXoU0Uw5ZrrhJLqEbdmW-LsEx5tWGXP3dfQ3HZTgmJHHdQGu32eMtHJnP3WK7uSs0-g2lR57G
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH9BNFEvKGD8tgePTrqu7bYzASHCQsJiuJFue024DMKH8c-33SZ48OLttWmapi9tX9_H7wfwzHVAUVDP0ZprhweJMveglzlaBYFIuKKqwNn-GPlRFMxm4aQGL_taGEQsks_w1YpFLD9bpjvrKusIy9bNgiM4FpwzWlZrHTwqoTF-fVn-zUPhGUunAnXat_kBZbPTnQ57JV6lZ_GZf3GrFE9Lv_G_RV1A-1CjRyb71-cSapg3ofFD0kCqM9uE8_EemHXTgiAq075J78tcA9ZTZiexlDLEiGYgma5KFiMSrxHJIidvFtJ604a434u7A6ciT3AWId06CfVE6mVKMqMKn4fINWWYupngrg4SjcZsQD9zkWcqSROpFGepUlIbY1sio94V1PNljtdAEpdlGkUqWRJymWkljRKprzTyUImU3UDL7sp8VcJjzKsNuf27-wlOB_F4NB8No_c7OCuDMzal6x7q2_UOH-Ak_dwuNuvHQrvfGt6iDQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+WRI+World+Congress+on+Computer+Science+and+Information+Engineering+%3A+March+31%2C+2009-April+2%2C+2009&rft.atitle=Network+Expansion+Problem+on+the+Spanning+Tree+in+Graphs&rft.au=Jianping+Li&rft.au=Juanping+Zhu&rft.date=2009-03-01&rft.pub=IEEE&rft.isbn=9780769535074&rft.volume=2&rft.spage=691&rft.epage=695&rft_id=info:doi/10.1109%2FCSIE.2009.336&rft.externalDocID=5171428
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769535074/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769535074/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769535074/sc.gif&client=summon&freeimage=true