2007年4月
Minimum cost subpartitions in graphs
INFORMATION PROCESSING LETTERS
- ,
- 巻
- 102
- 号
- 2-3
- 開始ページ
- 79
- 終了ページ
- 84
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.ipl.2006.11.011
- 出版者・発行元
- ELSEVIER SCIENCE BV
Given an edge-weighted graph G = (V, E), a subset S subset of V, an integer k >= 1 and a real b >= 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X(1), X(2), ..., X(k) subset of S with d(X(i)) <= b, l <= i <= k, so as to minimize Sigma(1 <= i <= k) d(X(i)), where d(X) denotes the total weight of edges between X and V - X. In this paper, we show that the minimum subpartition problem can be solved in O(mn + n(2) log n) time. The result is then applied to the minimum k-way cut problem and the graph strength problem to improve the previous best time bounds of 2-approximation algorithms for these problems to O(mn + n(2) log n). (c) 2006 Elsevier B.V. All rights reserved.
- リンク情報
-
- DOI
- https://doi.org/10.1016/j.ipl.2006.11.011
- DBLP
- https://dblp.uni-trier.de/rec/journals/ipl/NagamochiK07
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000244994100008&DestApp=WOS_CPL
- URL
- http://dblp.uni-trier.de/db/journals/ipl/ipl102.html#journals/ipl/NagamochiK07
- ID情報
-
- DOI : 10.1016/j.ipl.2006.11.011
- ISSN : 0020-0190
- DBLP ID : journals/ipl/NagamochiK07
- Web of Science ID : WOS:000244994100008