Sciweavers

432 search results - page 69 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
ICCCN
2007
IEEE
14 years 1 months ago
Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks
Abstract— With the rapid deployment of wireless sensor networks, there are several new sensing applications with specific requirements. Specifically, target tracking applicatio...
Sachin Parikh, Vinod Vokkarane, Liudong Xing, Daya...
TRIDENTCOM
2005
IEEE
14 years 1 months ago
Wireless Link SNR Mapping Onto An Indoor Testbed
To facilitate a broad range of experimental research on novel protocols and application concepts, we employ an indoor wireless testbed to emulate the performance of the real-world...
Jing Lei, Roy D. Yates, Larry J. Greenstein, Hang ...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 26 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 27 days ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
STACS
2009
Springer
14 years 2 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey