Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours-Reference-Cited by-同舟云学术

Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours

Published: Issue: Volume: Page:282-295
ISSN:
Container-title:Distributed Computing in Sensor Systems
language:
Short-container-title:

Author:

Funke Stefan,Laue Sören,Naujoks Rouven,Lotker Zvi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-69170-9_19.pdf

Reference17 articles.

1. Alt, H., Arkin, E.M., Brönnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: SCG 2006: Proc. 22nd Ann. Symp. on Computational Geometry, pp. 449–458. ACM Press, New York (2006)

2. Ambühl, C.: An optimal bound for the mst algorithm to compute energy-efficient broadcast trees in wireless networks. In: ICALP, pp. 1139–1150 (2005)

3. Ambühl, C., Clementi, A.E.F., Ianni, M.D., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks. In: STACS, pp. 418–427 (2004)

4. Andreae, T.: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38(2), 59–67 (2001)

5. Bender, M.A., Chekuri, C.: Performance guarantees for the TSP with a parameterized triangle inequality. Information Processing Letters 73(1–2), 17–21 (2000)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Symmetric connectivity with directional antennas;Computational Geometry;2013-11

2. THE TRAVELING SALESMAN PROBLEM UNDER SQUARED EUCLIDEAN DISTANCES;LEIBNIZ INT PR INFOR;2010