3875 search results - page 382 / 775 » Approximation algorithms for the 0-extension problem |
186
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
188
click to vote
INFOCOM
2003
IEEE
16 years 3 days ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
180
click to vote
EWSN
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
175
click to vote
STACS
2004
Springer
16 years 5 days ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
182
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...