653 search results - page 38 / 131 » The size of minimum 3-trees |
135
click to vote
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
106
click to vote
COR
2000
14 years 11 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
119
click to vote
DATAMINE
2002
14 years 11 months ago
2002
Collaborative recommender systems allow personalization for e-commerce by exploiting similarities and dissimilarities among customers' preferences. We investigate the use of a...
SIAMJO
2010
14 years 6 months ago
2010
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...