Sciweavers

7006 search results - page 556 / 1402
» Approximation Algorithms
Sort
View
185
Voted
JCO
2006
103views more  JCO 2006»
15 years 6 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
MP
2006
84views more  MP 2006»
15 years 6 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
SPAA
2010
ACM
15 years 7 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
WG
2007
Springer
16 years 28 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
CVPR
1999
IEEE
16 years 8 months ago
Estimation of Epipolar Geometry from Apparent Contours: Affine and Circular Motion Cases
This paper addresses the problem of estimating the epipolar geometry from apparent contours in two special cases: under weak perspective and for circular motion. An appropriate pa...
Paulo R. S. Mendonça, Roberto Cipolla