3875 search results - page 235 / 775 » Approximation algorithms for the 0-extension problem |
140
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
148
click to vote
DKE
2008
15 years 6 months ago
2008
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
154
click to vote
ESA
2007
Springer
16 years 12 days ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
166
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
136
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...