Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
77
0

Year Published

2003
2003
2015
2015

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 114 publications
(78 citation statements)
references
References 10 publications
1
77
0
Order By: Relevance
“…General min-power connectivity problems were studied extensively, see for example [4,1,2,5,7] for only a small sample of papers in this area. The best known ratio for MPST is 5/3 + ε [1].…”
Section: Previous and Related Workmentioning
confidence: 99%
“…General min-power connectivity problems were studied extensively, see for example [4,1,2,5,7] for only a small sample of papers in this area. The best known ratio for MPST is 5/3 + ε [1].…”
Section: Previous and Related Workmentioning
confidence: 99%
“…The min-total assignment problem was studied by Kiroustis, et al [32] and by Clementi, et al [33], [34], [35]. Kiroustis, et al [32] first proved that the min-total assignment problem is NP-hard when the mobile nodes are deployed in a threedimensional space.…”
Section: B Power Assignmentmentioning
confidence: 99%
“…The algorithm guarantees the same approximation ratio in any dimensions. Clementi, et al [33], [34], [35] proved that the min-total assignment problem is still NP-hard when nodes are deployed in a two dimensional space.…”
Section: B Power Assignmentmentioning
confidence: 99%
“…In this case, the min-cost variant is just the min-cost spanning tree problem, while the min-power variant is NP-hard even in the Euclidean plane [9]. There are several localized and distributed heuristics to find the range assignment to keep the network connected [18,24,25].…”
Section: Introductionmentioning
confidence: 99%