Sciweavers

710 search results - page 24 / 142
» On Minimum Power Connectivity Problems
Sort
View
COMPGEOM
1990
ACM
13 years 11 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...
INFOCOM
2011
IEEE
12 years 11 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
JCAM
2010
82views more  JCAM 2010»
13 years 2 months ago
Menke points on the real line and their connection to classical orthogonal polynomials
Abstract. We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show th...
P. Mathur, J. S. Brauchart, Edward B. Saff
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 7 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus
STACS
2009
Springer
14 years 2 months ago
Hardness and Algorithms for Rainbow Connectivity
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...