5595 search results - page 142 / 1119 » Approximation Algorithms for Clustering Problems |
132
click to vote
AAIM
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
141
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
142
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
211
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
167
click to vote
NETWORKS
2002
15 years 4 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...