7006 search results - page 570 / 1402 » Approximation Algorithms |
230
click to vote
COCOON
2005
Springer
16 years 16 days ago
2005
Springer
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
192
Voted
IJFCS
2006
15 years 7 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
188
click to vote
NETWORKS
2007
15 years 6 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
236
click to vote
JMLR
2012
13 years 9 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
192
click to vote
NIPS
2007
15 years 8 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...