Deploying sensor networks with guaranteed capacity and fault tolerance
Authors:
Open Access
- 25 May 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 309-319
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Efficient Topology Control for Ad-Hoc Wireless Networks with Non-Uniform Transmission RangesWireless Networks, 2005
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected SubgraphSIAM Journal on Computing, 2003
- Symmetric Connectivity with Minimum Power Consumption in Radio Networks2002
- Power consumption in packet radio networksTheoretical Computer Science, 2000
- Steiner tree problem with minimum number of Steiner points and bounded edge-lengthInformation Processing Letters, 1999
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related ProblemsSIAM Journal on Computing, 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- A polynomial time approximation scheme for euclidean minimum cost k-connectivity1998
- Improved Approximation Algorithms for Uniform Connectivity ProblemsJournal of Algorithms, 1996
- An application of submodular flowsLinear Algebra and its Applications, 1989