3894 search results - page 528 / 779 » Approximation Algorithms for Biclustering Problems |
113
click to vote
ESA
2007
Springer
15 years 10 months 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...
135
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
110
click to vote
ESA
2006
Springer
15 years 7 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 ...
137
click to vote
AIPS
2008
15 years 6 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
117
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...