3875 search results - page 473 / 775 » Approximation algorithms for the 0-extension problem |
176
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
150
click to vote
ORL
2008
15 years 6 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
173
click to vote
ER
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
169
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
The profit of a retail product not only comes from its own sales, but also comes from its influence on the sales of other products. How to promote the right products to the righ...
192
click to vote
ADHOCNOW
2010
Springer
15 years 4 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...