2013年1月
FPTASs for trimming weighted trees
THEORETICAL COMPUTER SCIENCE
- ,
- ,
- 巻
- 469
- 号
- 開始ページ
- 105
- 終了ページ
- 118
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.tcs.2012.09.024
- 出版者・発行元
- ELSEVIER SCIENCE BV
Given a tree with nonnegative edge cost and nonnegative vertex weight, and a number k >= 0, we consider the following four cut problems: cutting vertices of weight at most or at least k from the tree by deleting some edges such that the remaining part of the graph is still a tree and the total cost of the edges being deleted is minimized or maximized. The MinMstCut problem (cut vertices of weight at most k and minimize the total cost of the edges being deleted) can be solved in linear time and space and the other three problems are NP-hard. In this paper, we design an 0(nl/epsilon)-time 0(l(2)/epsilon + n)-space algorithm for MaxMstCut, and 0(nl(1/epsilon + log n))-time 0(l(2)/epsilon + n)-space algorithms for the other two problems, MinLstCut and MaxLstCut, where n is the number of vertices in the tree, l the number of leaves, and epsilon > 0 the prescribed error bound. (c) 2012 Elsevier B.V. All rights reserved.
- リンク情報
-
- DOI
- https://doi.org/10.1016/j.tcs.2012.09.024
- DBLP
- https://dblp.uni-trier.de/rec/journals/tcs/XiaoFN13
- J-GLOBAL
- https://jglobal.jst.go.jp/detail?JGLOBAL_ID=201302247053840248
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000314137900008&DestApp=WOS_CPL
- URL
- http://dblp.uni-trier.de/db/journals/tcs/tcs469.html#journals/tcs/XiaoFN13
- ID情報
-
- DOI : 10.1016/j.tcs.2012.09.024
- ISSN : 0304-3975
- DBLP ID : journals/tcs/XiaoFN13
- J-Global ID : 201302247053840248
- Web of Science ID : WOS:000314137900008