628 search results - page 71 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
114
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
137
click to vote
IIS
2003
15 years 4 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
134
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
123
click to vote
IPPS
1998
IEEE
15 years 7 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...
128
click to vote
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...