Sciweavers

356 search results - page 50 / 72
» Submodular Approximation: Sampling-based Algorithms and Lowe...
Sort
View
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 2 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
SIROCCO
2004
13 years 9 months ago
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
Deshi Ye, Hu Zhang
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
13 years 6 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li
COCOON
2005
Springer
14 years 1 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
13 years 11 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs