136 search results - page 19 / 28 » A Constant-Factor Approximation Algorithm for the k-Median P... |
SPIRE
2010
Springer
13 years 5 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
ESA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—We suggest a novel approach to handle the ongoing explosive increase in the demand for video content in wireless/mobile devices. We envision femtocell-like base stations...