Journal of Algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Proceedings of the 9th annual international conference on Mobile computing and networking
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A network pricing game for selfish traffic
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Drawing planar graphs using the lmc-ordering
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Motivated by a routing protocol with VCG-style side payments, this paper investigates the combinatorial problem of placing new devices in an ad-hoc network such that the resulting shortest path distances are minimum. Here, distances reflect transmission costs that are quadratic in Euclidean distance. We show that the general problem of placing multiple new wireless devices, either with different or identical transmission ranges, is NP-hard under multiple communication requests. On the positive side, we provide polynomial-time algorithms for the cases with only one new device and/or one communication request. To that end, we define geometric objects that capture the general geometric structure of wireless networks.