5595 search results - page 791 / 1119 » Approximation Algorithms for Clustering Problems |
233
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
150
click to vote
ESA
2007
Springer
16 years 27 days ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
142
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
186
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
188
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...