Sciweavers

367 search results - page 34 / 74
» Set connectivity problems in undirected graphs and the direc...
Sort
View
TPDS
2008
136views more  TPDS 2008»
13 years 8 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
FPL
2008
Springer
126views Hardware» more  FPL 2008»
13 years 10 months ago
Customized Reconfigurable Interconnection Networks for multiple application SOCS
A Customized Reconfigurable Interconnection Network (CRIN) refers to a minimal switching network, yielding routing solutions for any element in a pre-given set of routing requirem...
Hongbing Fan, Jason Ernst, Yu-Liang Wu
DCOSS
2005
Springer
14 years 2 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
13 years 10 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...