12519 search results - page 400 / 2504 » Approximation Problems Categories |
206
click to vote
ESA
2007
Springer
16 years 29 days ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
176
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
206
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
216
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
183
click to vote
TIT
2010
15 years 1 months ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...