5595 search results - page 980 / 1119 » Approximation Algorithms for Clustering Problems |
165
click to vote
SSD
2005
Springer
15 years 10 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
133
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
134
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
141
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
145
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...