{"title":"2π3-MST的一个4-近似","authors":"Stav Ashur, Matthew J. Katz","doi":"10.1016/j.comgeo.2022.101914","DOIUrl":null,"url":null,"abstract":"<div><p><span>Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree (minimum) spanning trees, which have received significant attention. Let </span><em>P</em> be a set of <em>n</em> points in the plane, and let <span><math><mn>0</mn><mo><</mo><mi>α</mi><mo><</mo><mn>2</mn><mi>π</mi></math></span> be an angle. An <em>α</em>-spanning tree (<em>α</em>-ST) of <em>P</em> is a spanning tree of the complete Euclidean graph over <em>P</em>, with the following property: For each vertex <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><mi>P</mi></math></span>, the (smallest) angle that is spanned by all the edges incident to <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is at most <em>α</em>. An <em>α</em>-minimum spanning tree (<em>α</em>-MST) is an <em>α</em>-ST of <em>P</em> of minimum weight, where the weight of an <em>α</em>-ST is the sum of the lengths of its edges. In this paper, we consider the problem of computing an <em>α</em>-MST for the case where <span><math><mi>α</mi><mo>=</mo><mfrac><mrow><mn>2</mn><mi>π</mi></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>. We present a 4-approximation algorithm, thus improving upon the previous results of Aschner and Katz and Biniaz et al., who presented algorithms with approximation ratios 6 and <span><math><mfrac><mrow><mn>16</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>, respectively.</p><p>To obtain this result, we devise an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span><span>-time algorithm that, given any Hamiltonian path Π of </span><em>P</em>, constructs a <span><math><mfrac><mrow><mn>2</mn><mi>π</mi></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>-ST <span><math><mi>T</mi></math></span> of <em>P</em>, such that <span><math><mi>T</mi></math></span>'s weight is at most twice that of Π and, moreover, <span><math><mi>T</mi></math></span> is a 3-hop spanner of Π. This latter result is optimal (with respect to <span><math><mi>T</mi></math></span>'s weight), since for any <span><math><mi>ε</mi><mo>></mo><mn>0</mn></math></span> there exists a polygonal path for which every <span><math><mfrac><mrow><mn>2</mn><mi>π</mi></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>-ST (of the corresponding set of points) has weight greater than <span><math><mn>2</mn><mo>−</mo><mi>ε</mi></math></span> times the weight of the path.</p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A 4-approximation of the 2π3-MST\",\"authors\":\"Stav Ashur, Matthew J. Katz\",\"doi\":\"10.1016/j.comgeo.2022.101914\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree (minimum) spanning trees, which have received significant attention. Let </span><em>P</em> be a set of <em>n</em> points in the plane, and let <span><math><mn>0</mn><mo><</mo><mi>α</mi><mo><</mo><mn>2</mn><mi>π</mi></math></span> be an angle. An <em>α</em>-spanning tree (<em>α</em>-ST) of <em>P</em> is a spanning tree of the complete Euclidean graph over <em>P</em>, with the following property: For each vertex <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><mi>P</mi></math></span>, the (smallest) angle that is spanned by all the edges incident to <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is at most <em>α</em>. An <em>α</em>-minimum spanning tree (<em>α</em>-MST) is an <em>α</em>-ST of <em>P</em> of minimum weight, where the weight of an <em>α</em>-ST is the sum of the lengths of its edges. In this paper, we consider the problem of computing an <em>α</em>-MST for the case where <span><math><mi>α</mi><mo>=</mo><mfrac><mrow><mn>2</mn><mi>π</mi></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>. We present a 4-approximation algorithm, thus improving upon the previous results of Aschner and Katz and Biniaz et al., who presented algorithms with approximation ratios 6 and <span><math><mfrac><mrow><mn>16</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>, respectively.</p><p>To obtain this result, we devise an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span><span>-time algorithm that, given any Hamiltonian path Π of </span><em>P</em>, constructs a <span><math><mfrac><mrow><mn>2</mn><mi>π</mi></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>-ST <span><math><mi>T</mi></math></span> of <em>P</em>, such that <span><math><mi>T</mi></math></span>'s weight is at most twice that of Π and, moreover, <span><math><mi>T</mi></math></span> is a 3-hop spanner of Π. This latter result is optimal (with respect to <span><math><mi>T</mi></math></span>'s weight), since for any <span><math><mi>ε</mi><mo>></mo><mn>0</mn></math></span> there exists a polygonal path for which every <span><math><mfrac><mrow><mn>2</mn><mi>π</mi></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>-ST (of the corresponding set of points) has weight greater than <span><math><mn>2</mn><mo>−</mo><mi>ε</mi></math></span> times the weight of the path.</p></div>\",\"PeriodicalId\":51001,\"journal\":{\"name\":\"Computational Geometry-Theory and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Geometry-Theory and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925772122000578\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Geometry-Theory and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925772122000578","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree (minimum) spanning trees, which have received significant attention. Let P be a set of n points in the plane, and let be an angle. An α-spanning tree (α-ST) of P is a spanning tree of the complete Euclidean graph over P, with the following property: For each vertex , the (smallest) angle that is spanned by all the edges incident to is at most α. An α-minimum spanning tree (α-MST) is an α-ST of P of minimum weight, where the weight of an α-ST is the sum of the lengths of its edges. In this paper, we consider the problem of computing an α-MST for the case where . We present a 4-approximation algorithm, thus improving upon the previous results of Aschner and Katz and Biniaz et al., who presented algorithms with approximation ratios 6 and , respectively.
To obtain this result, we devise an -time algorithm that, given any Hamiltonian path Π of P, constructs a -ST of P, such that 's weight is at most twice that of Π and, moreover, is a 3-hop spanner of Π. This latter result is optimal (with respect to 's weight), since for any there exists a polygonal path for which every -ST (of the corresponding set of points) has weight greater than times the weight of the path.
期刊介绍:
Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems.
Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.